Recursion and Binary Search

Related lectures (22)

Page 1 of 3

Provides an overview of essential search and sort algorithms in computer science.

Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.

Explains binary search, the logarithm function, and recursive algorithms for factorial and Fibonacci sequences.

Explains the binary search algorithm using two pointers to efficiently search a sorted list.

Explores worst-case complexity, mathematical induction, and algorithms like binary search and insertion sort.

Covers the binary search algorithm and provides a step-by-step example.

Covers algorithms for searching, sorting, optimization, and the Halting Problem.

Explores binary search, merge sort, recursion in algorithms, Fibonacci numbers, and dynamic programming.

Explores optimization problems and greedy algorithms for efficient decision-making.

Explores dynamic programming for palindromic subsequences, merging binary search trees, and finding the median of two sorted arrays.