jpfr12 / algorithmsanddatastructures Goto Github PK

Sorting algorithms:

1.1. Merge Sort

1.2. Insertion Sort

1.3. Quick Sort

1.4. Counting Sort

Graph/Trees algorithms:

2.1. Depth-First Search (DFS)

2.2. Bread-First Search (BFS)

2.3. Shortest Path

• 2.3.1. Dijkstra

• 2.3.2. Bellman-Ford (TODO)

2.4. Minimum Spanning Trees:

• 2.4.1. Kruskal Algorithm

• 2.4.2. Prim's Algorithm

Searching Algorithms:

3.1 Binary Search

3.2 Ternary Search

Amortized Algorithms (Common optimization techniques):

4.1. Sliding Window

4.2. Line Sweep

4.3. Monotonic Stack

4.4. Monotonic Queue

Data Structures:

5.1 Segment Tree

5.2 Binary Index Tree (TODO)

5.3 Union-Find

5.4 AVL tree (balanced BST)