Lecture
Recursive Sorting: Merge Sort
Related lectures (37)
Complexity & Induction: Algorithms & Proofs
Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.
Merge Sort: Sorting Algorithm
Explains the merge sort algorithm, its correctness, and time complexity compared to other sorting algorithms.
Query Processing with Relational Operations
Covers query processing with relational operations, including query optimization and different join algorithms.
Sorting Algorithms: Selection and Insertion
Introduces selection and insertion sorting algorithms, explaining their correctness and time complexity.
Optimization Algorithms: Greedy Approach
Explores optimization problems and greedy algorithms for efficient decision-making.
Complexity & Induction: Algorithms & Proofs
Explores worst-case complexity, mathematical induction, and algorithms like binary search and insertion sort.
Excel Data Analysis and Forecasting
Covers the basics of Excel data analysis and forecasting techniques.
Selection Sort: Efficiency and Complexity
Explores the efficiency and complexity of the selection sort algorithm compared to other sorting methods.
Algorithm Design: Divide and Conquer
Covers recursion, dynamic programming, and algorithm design using divide and conquer strategies.
Merge Sort: Divide and Conquer
Covers the merge sort algorithm, which recursively divides, sorts, and merges sublists to achieve a final sorted list.