Graph Algorithms
Algorithms for traversing and finding paths in graphs, including BFS, DFS, Dijkstra's, and A*.
Data-Structures
Hash Tables
Data structures that map keys to values using hash functions for near-constant-time lookup, insertion, and deletion.
Heaps and Priority Queues
Tree-based data structures that efficiently support finding and extracting the minimum or maximum element.
Linked Lists, Stacks, and Queues
Fundamental linear data structures for organizing and accessing data sequentially.
Search Algorithms
Algorithms for finding elements in data structures, including linear search, binary search, and interpolation search.
Trees and Binary Search Trees
Hierarchical data structures including BSTs, AVL trees, red-black trees, and B-trees for efficient searching and storage.
Data Structures for AI Applications
Arrays, hash maps, trees, graphs, queues, and vector stores - how the choice of data structure shapes the performance of AI pipelines.
Sorting and Search Algorithms for AI Pipelines
How sorting and search algorithms underpin AI pipeline design: complexity trade-offs, partial sorting for top-k selection, tiered analysis …