Merge Sort: Sorting Algorithm

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (22)

Page 2 of 3

Dynamic Programming: Palindromic Subsequences

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

Derivatives, O-Notation

Explores derivatives, O-Notation, extrema, and algorithm complexity in Analysis 1.

Quick Sort: Divide-and-Conquer

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

Merge Sort: Divide-and-Conquer

Introduces Merge Sort, a divide-and-conquer algorithm for efficient array sorting, discussing correctness, runtime analysis, linear-time merging, and recurrence solving techniques.

Complexity & Induction: Algorithms & Proofs

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

Insertion Sort: Basics and Analysis

Introduces Insertion Sort, explaining its basics, insertion process, and correctness analysis.

Introduction to Algorithms: Course Overview and Basics

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

Merge Sort: Divide and Conquer

Introduces growth of functions, sorting problem, insertion sort, computational model, and merge sort.

Algorithm Complexity Analyses

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

Recursive Sorting: Merge Sort

Covers the concept of Merge Sort, a recursive sorting algorithm that divides a list into sublists until each sublist has one element.