Skip to content

CAEL0/algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Algorithm

Python and C++ Codes for some Algorithms and Data Structures

  • Data Structure

    • Binary Search Tree

    • Disjoint Set (Union Find)

    • Fenwick Tree

      • 2d Fenwick tree
      • Fenwick tree
    • Heap

      • min heap
    • Heavy-Light Decomposition

    • Linked List

      • singly linked list
      • doubly linked list
    • Segment Tree

      • lazy propagation
      • Li Chao tree
      • maximum subarray problem
      • merge sort tree
      • persistent segment tree
      • range update point query
      • segment tree beats
    • Sparse Table

    • String

      • rope
      • trie
    • binary trie
    • bitset
    • offline dynamic connectivity
    • policy based data structures
  • Dynamic Programming

    • connection profile dp
    • convex hull trick
    • divide and conquer optimization
    • knapsack problem
    • Knuth's optimization
    • travelling salesman problem
  • Geometry

    • Convex Hull

      • Graham scan
      • monotone chain
      • point in convex polygon
    • rotating calipers
  • Graph Theory

    • Biconnected Component

    • Bipartite Graph

      • bipartite matching
    • Flow Network

      • Dinic's algorithm
      • Edmonds-Karp algorithm
      • Ford-Fulkerson algorithm
      • Hopcroft-Karp algorithm
      • max-flow min-cut theorem
      • minimum cost maximum flow
    • Minimum Spanning Tree

      • Kruskal's algorithm
      • Prim's algorithm
    • Shortest Path

      • Bellman-Ford algorithm
      • Dijkstra's algorithm
      • Floyd-Warshall algorithm
      • shortest path faster algorithm
    • Sort

      • topological sorting
    • Strongly Connected Component

      • 2-satisfiability
      • Kosaraju's algorithm
      • Tarjan's algorithm
    • Tree

      • Euler tour technique
      • lowest common ancestor
    • Hierholzer's algorithm
  • Mathematics

    • Fast Fourier Transform

      • xor convolution
    • Linear Algebra

      • Gaussian elimination
      • matrix multiplication
    • Number Theory

      • combination
      • Euler's phi (totient) function
      • extended Euclidean algorithm
      • floor sum
      • harmonic lemma
      • integer partition
      • Lucas' theorem
      • multiplicative functions
      • power tower
    • Primality Test

      • Miller-Rabin primality test
    • Prime Factorization

      • Pollard's rho algorithm
      • sieve of Eratosthenes
  • Miscellaneous

    • Berlekamp-Massey algorithm
    • Boyer-Moore majority vote algorithm
    • imos method
    • int128
    • Kadane's algorithm
    • Knuth's algorithm X
    • Mo's algorithm
    • parallel binary search
    • permutation cycle decomposition
    • prefix sum
    • small to large trick
    • square root decomposition
    • Sprague-Grundy theorem
    • ternary search
  • String

    • Aho-Corasick algorithm
    • Knuth-Morris-Pratt algorithm
    • Manacher's algorithm
    • suffix array and lcp array
    • z algorithm

About

Algorithms & Data Structures

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages