Algorithms and Data Structures in TypeScript Table of contents: Data Structures Linked List Queue Priority Queue Heap Stack Hash Table Graph Bloom Filter Algorithms Sorting Insertion sort Selection sort Merge sort Quick sort Order Statistics Randomized selection Graphs DFS (Depth-first search) BFS (Breath-first search) Dijkstra SCC (Strongly-connected components) Topological ordering References Stanford > Algorithms: Design and Analysis, Part 1 Stanford > Algorithms: Design and Analysis, Part 2 MIT > Introduction to Algorithms MIT > Design and Analysis of Algorithms MIT > Advanced Data Structures License MIT