It was written

• in c++23, but uses only up to c++17 features .

• the coding styles would be as follows

  • snake_case for variables and functions
  • PascalCase for classes and structs
  • UPPER_SNAKE_CASE for macros and constants
  • using namespace std; is used in the global scope
  • maximize the usage of standard library
  • minimize the usage of pointer
  • only in linked list, tree and other data structures, in which, there has to be indefinite number of nodes, pointer is used so that struct can be validly defined. However, only use raw pointers instead of smart pointers.
  • minimize the usage of bitwise operators, unless it is necessary. We believe that compilers are smart enough to optimize the code.

• Segment Tree

  • ZKW Segment Tree
  • Segment Tree

• Binary Indexed Tree

  • Binary Indexed Tree

• Shortest path

  • Dijkstra
  • Bellman-Ford
  • Floyd
  • A Star

• Minimal Spanning Tree

  • Prim
  • Kruskal

• Other Tree-Related

  • Heap
  • Trie
  • Huffman

• Bisect

  • Bisect
  • Binary Search Tree
  • Red-Black Tree

• Sort

  • Quick Sort
  • Merge Sort
  • Bucket Sort

• Other Graph-Related

  • Critical Path
  • Disjoint Set
  • Max Flow

• Geometry

  • Closest Pair
  • Convex Hull

• Uncategorized

  • KMP
  • K Largest By Divide and Decrease