Sorting Algorithms: Sorting Methods and Comparison

Related lectures (22)

Page 1 of 3

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

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

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

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

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

Discusses matrix multiplication using divide-and-conquer techniques and introduces Strassen's algorithm for improved efficiency.

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

Discusses Strassen's algorithm for matrix multiplication and heaps, covering efficient algorithms and their applications in computer science.

Explains recursive sorting using Merge Sort and its linearithmic complexity.

Explores examples of algorithm complexity, sorting, and polynomial computations.