Algorithms Lab
Step through sorting, trees, graphs, DP, hashing and more. Watch six sorting algorithms compare and swap; run binary search and its bound variants; rewire a linked list; push and pop stacks, queues and a circular buffer; insert into hash tables with chaining or probing; grow a BST and balance it as an AVL tree; sift a heap; union and find with path compression; step BFS, DFS, Dijkstra, Prim, Kruskal and topological sort; fill LCS, edit-distance and knapsack tables; query segment and Fenwick trees; trace KMP; and backtrack through N-Queens.