GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — Algorithm-patterns/Other_Algorithms at main · ezpectus/Algorithm-patterns

Expand file tree

/

Other_Algorithms

/
Copy path

Directory actions

More options

More options

Directory actions

More options

More options

Latest commit

 

History

History
History
/

Other_Algorithms

/
Copy path

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
2D Fenwick Tree (Binary Indexed Tree).md
2D Fenwick Tree (Binary Indexed Tree).md
 
 
2D Segment Tree.md
2D Segment Tree.md
 
 
2‑SAT via SCC Condensation.md
2‑SAT via SCC Condensation.md
 
 
A* Algorithm — Heuristic Pathfinding Engine.md
A* Algorithm — Heuristic Pathfinding Engine.md
 
 
Aho-Corasick Automaton.md
Aho-Corasick Automaton.md
 
 
Alpha–Beta Pruning.md
Alpha–Beta Pruning.md
 
 
Amortized Analysis.md
Amortized Analysis.md
 
 
Approximation Algorithms.md
Approximation Algorithms.md
 
 
B-Tree & B+ Tree.md
B-Tree & B+ Tree.md
 
 
Baby-step Giant-step (BSGS) — Discrete Logarithm.md
Baby-step Giant-step (BSGS) — Discrete Logarithm.md
 
 
Bellman–Ford with Negative Cycle Detection.md
Bellman–Ford with Negative Cycle Detection.md
 
 
Biconnected Components.md
Biconnected Components.md
 
 
Binary Lifting → LCA и jump‑queries.md
Binary Lifting → LCA и jump‑queries.md
 
 
Bitap Algorithm — Approximate String Matching.md
Bitap Algorithm — Approximate String Matching.md
 
 
Bitmask DP — TSP and Set Cover DP.md
Bitmask DP — TSP and Set Cover DP.md
 
 
Boykov–Kolmogorov Maxflow.md
Boykov–Kolmogorov Maxflow.md
 
 
Bridges and Articulation Points.md
Bridges and Articulation Points.md
 
 
Burrows–Wheeler Transform — Permutation for Compression.md
Burrows–Wheeler Transform — Permutation for Compression.md
 
 
CDCL — Conflict-Driven Clause Learning.md
CDCL — Conflict-Driven Clause Learning.md
 
 
Cache-Oblivious Algorithms.md
Cache-Oblivious Algorithms.md
 
 
Cartesian Tree.md
Cartesian Tree.md
 
 
Centroid Decomposition.md
Centroid Decomposition.md
 
 
Chinese Remainder Theorem (CRT) — Algorithm and Applications.md
Chinese Remainder Theorem (CRT) — Algorithm and Applications.md
 
 
Chu–Liu&Edmonds’ Algorithm — Directed Minimum Spanning Tree.md
Chu–Liu&Edmonds’ Algorithm — Directed Minimum Spanning Tree.md
 
 
Closest Pair of Points (Divide & Conquer).md
Closest Pair of Points (Divide & Conquer).md
 
 
Convex Hull Trick & Li Chao Tree — Dynamic Programming Optimization.md
Convex Hull Trick & Li Chao Tree — Dynamic Programming Optimization.md
 
 
Convex Hull Trick (CHT) — Standalone.md
Convex Hull Trick (CHT) — Standalone.md
 
 
DAWG — Directed Acyclic Word Graph.md
DAWG — Directed Acyclic Word Graph.md
 
 
DP Optimization Techniques.md
DP Optimization Techniques.md
 
 
DPLL — Davis–Putnam–Logemann–Loveland Algorithm.md
DPLL — Davis–Putnam–Logemann–Loveland Algorithm.md
 
 
DSU on Tree — Subtree Query Engine.md
DSU on Tree — Subtree Query Engine.md
 
 
Dancing Links (DLX) — Exact Cover Engine.md
Dancing Links (DLX) — Exact Cover Engine.md
 
 
Delaunay Triangulation — Geometric Dual of Voronoi.md
Delaunay Triangulation — Geometric Dual of Voronoi.md
 
 
Digit DP — Count Numbers with Digit Constraints.md
Digit DP — Count Numbers with Digit Constraints.md
 
 
Dijkstra’s Algorithm.md
Dijkstra’s Algorithm.md
 
 
Dinic & Push–Relabel.md
Dinic & Push–Relabel.md
 
 
Disjoint Set with Parity.md
Disjoint Set with Parity.md
 
 
Dominator Tree (Lengauer–Tarjan Algorithm).md
Dominator Tree (Lengauer–Tarjan Algorithm).md
 
 
Dynamic Trees (Top Trees).md
Dynamic Trees (Top Trees).md
 
 
Edmonds–Karp Algorithm.md
Edmonds–Karp Algorithm.md
 
 
Edmonds’ Blossom Algorithm.md
Edmonds’ Blossom Algorithm.md
 
 
Eertree Extensions — Palindromic Factorization.md
Eertree Extensions — Palindromic Factorization.md
 
 
Eertree — Palindromic Substring Engine.md
Eertree — Palindromic Substring Engine.md
 
 
Ellipsoid Method.md
Ellipsoid Method.md
 
 
Euler Path&Euler Circuit.md
Euler Path&Euler Circuit.md
 
 
Euler's Totient Function & Multiplicative Functions.md
Euler's Totient Function & Multiplicative Functions.md
 
 
Extended Euclidean Algorithm + Bézout Coefficients.md
Extended Euclidean Algorithm + Bézout Coefficients.md
 
 
External Memory Algorithms.md
External Memory Algorithms.md
 
 
FFT && NTT— Fast Convolution Engines.md
FFT && NTT— Fast Convolution Engines.md
 
 
FM-Index — Substring Query Index over BWT.md
FM-Index — Substring Query Index over BWT.md
 
 
Fast Walsh-Hadamard Transform (FWHT).md
Fast Walsh-Hadamard Transform (FWHT).md
 
 
Fenwick Tree.md
Fenwick Tree.md
 
 
Finger Trees.md
Finger Trees.md
 
 
Floyd–Warshall with Path Reconstruction.md
Floyd–Warshall with Path Reconstruction.md
 
 
Floyd–Warshall.md
Floyd–Warshall.md
 
 
Ford–Fulkerson Algorithm — Maximum Flow in Networks.md
Ford–Fulkerson Algorithm — Maximum Flow in Networks.md
 
 
Fractional Cascading.md
Fractional Cascading.md
 
 
Functional Graph — Cycle Detection, k-th Ancestor.md
Functional Graph — Cycle Detection, k-th Ancestor.md
 
 
Gabow’s Algorithm — Stack-Based SCC Engine.md
Gabow’s Algorithm — Stack-Based SCC Engine.md
 
 
Gale–Shapley Algorithm.md
Gale–Shapley Algorithm.md
 
 
Gaussian Elimination over GF(2) and over a Field.md
Gaussian Elimination over GF(2) and over a Field.md
 
 
Gomory–Hu Tree: All-pairs Min-cut in Undirected Graphs.md
Gomory–Hu Tree: All-pairs Min-cut in Undirected Graphs.md
 
 
Half-Plane Intersection.md
Half-Plane Intersection.md
 
 
Hamiltonian Path — Backtracking + DP Bitmask.md
Hamiltonian Path — Backtracking + DP Bitmask.md
 
 
HeapSort — In-Place Sorting Pyramid.md
HeapSort — In-Place Sorting Pyramid.md
 
 
Heavy-Light Decomposition.md
Heavy-Light Decomposition.md
 
 
Hopcroft–Karp Algorithm — Bipartite Matching Engine.md
Hopcroft–Karp Algorithm — Bipartite Matching Engine.md
 
 
Hungarian Algorithm.md
Hungarian Algorithm.md
 
 
Hybrid Constraint Engines — System-Level Algorithms for Structured Problems.md
Hybrid Constraint Engines — System-Level Algorithms for Structured Problems.md
 
 
IDA* — Memory-Efficient Heuristic Search Engine.md
IDA* — Memory-Efficient Heuristic Search Engine.md
 
 
Interior-Point Method.md
Interior-Point Method.md
 
 
Introsort.md
Introsort.md
 
 
Johnson’s algorithm: All-pairs shortest paths with negative weights.md
Johnson’s algorithm: All-pairs shortest paths with negative weights.md
 
 
KD-Tree.md
KD-Tree.md
 
 
KMP-Algorithm.md
KMP-Algorithm.md
 
 
Kinetic Heaps &&Kinetic Data Structures.md
Kinetic Heaps &&Kinetic Data Structures.md
 
 
Kuhn–Munkres (Hungarian) Algorithm.md
Kuhn–Munkres (Hungarian) Algorithm.md
 
 
Line-Segment Intersection (Shamos-Hoey & Bentley-Ottmann).md
Line-Segment Intersection (Shamos-Hoey & Bentley-Ottmann).md
 
 
Linear Recurrence + Berlekamp–Massey.md
Linear Recurrence + Berlekamp–Massey.md
 
 
Link&Cut Trees.md
Link&Cut Trees.md
 
 
Link–Cut Tree & Euler Tour Tree.md
Link–Cut Tree & Euler Tour Tree.md
 
 
Lyndon Factorization + Duval Algorithm.md
Lyndon Factorization + Duval Algorithm.md
 
 
Manacher’s Algorithm.md
Manacher’s Algorithm.md
 
 
Matroid Intersection.md
Matroid Intersection.md
 
 
Merge Sort Tree.md
Merge Sort Tree.md
 
 
Micali–Vazirani Algorithm.md
Micali–Vazirani Algorithm.md
 
 
Miller-Rabin standalone.md
Miller-Rabin standalone.md
 
 
Min-Cost Flow.md
Min-Cost Flow.md
 
 
Minimax — Game Tree Search Algorithm.md
Minimax — Game Tree Search Algorithm.md
 
 
Minkowski Sum.md
Minkowski Sum.md
 
 
Mo’s Algorithm.md
Mo’s Algorithm.md
 
 
Möbius Function + Sieve — Analytic Number Theory.md
Möbius Function + Sieve — Analytic Number Theory.md
 
 
Network Simplex & Min-Cost Flow.md
Network Simplex & Min-Cost Flow.md
 
 
NextTODO.md
NextTODO.md
 
 
Offline Algorithms Overview.md
Offline Algorithms Overview.md
 
 
Online Algorithms — Competitive Analysis, Ski Rental, Paging.md
Online Algorithms — Competitive Analysis, Ski Rental, Paging.md
 
 
Palindromic Tree (Eertree) — Online Engine for Palindrome Detection.md
Palindromic Tree (Eertree) — Online Engine for Palindrome Detection.md
 
 
Parallel Algorithms Overview (PRAM Model).md
Parallel Algorithms Overview (PRAM Model).md
 
 
Persistent Segment Tree.md
Persistent Segment Tree.md
 
 
Pick's Theorem & Lattice Geometry.md
Pick's Theorem & Lattice Geometry.md
 
 
You are visitor 01402520 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.