Computation & Algorithms II: Binary Search and Merge Sort

Related lectures (25)

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

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.

Introduces the CS-250 Algorithms course, covering its structure, objectives, and key topics in algorithmic problem-solving.

Explores recursion, recursive algorithms, and sorting algorithms' efficiency for problem-solving and data organization.

Covers the complexity analyses of search and sorting algorithms.

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

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

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

Explains recursive sorting using Merge Sort and its linearithmic complexity.

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

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

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

Covers hashing, sorting, extendible hashing, linear hashing, and external sorting.

Covers the basics of algorithms, the importance of studying them, data structures, and the impact of algorithms on various fields.

Page 1 of 2