Search Algorithms: Linear vs Logarithmic

Related lectures (22)

Page 2 of 3

Covers basic algorithm ingredients, search algorithms, control structures, and algorithm correctness.

Explores algorithm growth, search complexities, and logarithmic properties in depth, with practical exercises included.

Introduces selection and insertion sorting algorithms, explaining their correctness and time complexity.

Explores the Quick Sort algorithm, focusing on its divide-and-conquer approach and time complexity analysis.

Explores the Merge Sort algorithm, applying the Divide and Conquer approach to sorting arrays efficiently.

Explores linear search, insertion sort, coin change, maximum matching, and the halting problem in algorithms.

Explores the theory of computation, undecidable problems, complexity measurement, and the P complexity class.

Explains recursive sorting using Merge Sort and its linearithmic complexity.

Explores sorting and recursive algorithms, including complexity analysis, maximal value, and binary search.