Computation & Algorithms II: Binary Search and Merge Sort

Related lectures (22)

Page 1 of 3

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

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

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

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

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.

Covers recursion, dynamic programming, and algorithm design using divide and conquer strategies.

Introduces recursion and binary search algorithms for efficient problem-solving.

Explains the merge sort algorithm, its correctness, and time complexity compared to other sorting algorithms.

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