Finally, we will study the priority queue data structure and showcase some applications. We will go through the quicksort and quickselect algorithms for sorting and selecting the kth smallest element ...

Building fast and highly performant data science applications requires an intimate knowledge of how data can be organized in a computer and how to efficiently perform operations such as sorting, ...

The design, implementation, and analysis of abstract data types, data structures and their algorithms. Topics include: data and procedural abstraction, amortized data structures, trees and search ...