Lectures related to Heapsort and Priority Queues

Hashing and Sorting Log in to Mediaspace to watch this video

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

Hashing & Sorting Log in to Mediaspace to watch this video

Explores hashing techniques like static, extendible, and linear hashing, along with sorting methods such as external merge sort and B+ trees.

Merge Sort: Divide-and-Conquer Log in to Mediaspace to watch this video

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

Derivatives, O-Notation Log in to Mediaspace to watch this video

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

Merge Sort: Divide, Conquer, Combine Log in to Mediaspace to watch this video

Explores Merge Sort, a sorting algorithm that divides, conquers, and combines arrays efficiently to achieve O(nlog n) time complexity.