Thirty standalone algorithm examples, surfaced from the package root:
two_sum.py– hash map pair finder in linear time.binary_search.py– iterative search on sorted sequences.merge_sort.py– stable divide-and-conquer sort.quick_select.py– k-th statistic selection in expected linear time.breadth_first_search.py– queue-based graph traversal.depth_first_search.py– recursive graph exploration.topological_sort.py– Kahn's algorithm for DAG ordering.dijkstra_shortest_path.py– priority-queue shortest paths.lru_cache.py– ordered dictionary backed LRU cache.knapsack_01.py– 0/1 knapsack dynamic program.bellman_ford.py– edge relaxation with negative-cycle detection.floyd_warshall.py– all-pairs shortest paths on dense graphs.prim_mst.py– minimum spanning tree via Prim's algorithm.kruskal_mst.py– MST construction with union-find.union_find.py– disjoint-set data structure.segment_tree.py– range-sum queries with point updates.fenwick_tree.py– binary indexed tree for prefix sums.trie.py– prefix tree with search and prefix checks.boyer_moore_majority.py– majority element by voting.kadane_max_subarray.py– maximum subarray sum in linear time.dutch_national_flag.py– three-way partition of 0/1/2 values.heap_sort.py– heap-based in-place sorting.sieve_of_eratosthenes.py– prime number generation.reservoir_sampling.py– uniform streaming sample of size k.sliding_window_maximum.py– deque based sliding extrema.rabin_karp.py– rolling hash substring search.kmp_search.py– prefix-function substring search.manacher_palindrome.py– longest palindromic substring in linear time.edit_distance.py– Levenshtein distance dynamic program.longest_common_subsequence.py– subsequence reconstruction DP.tarjan_scc.py– strongly connected components in directed graphs.