Complexity Analyses: Linear and Binary Search, Sorting Algorithms

Related lectures (24)

Page 1 of 3

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

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

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

Covers the complexity analyses of algorithms and their worst-case time complexities.

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

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

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

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

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

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