Hashing & Sorting

Related lectures (25)

Page 1 of 3

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

Provides an overview of hashing and sorting techniques in database management systems, focusing on their implementation and performance optimization.

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.

Covers the efficient implementation of hash tables and the Quick Sort algorithm.

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

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

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

Covers B+ Trees, a key data structure for efficient indexing in databases.

Covers the concept of Merge Sort, a highly efficient recursive sorting algorithm.