Bubble Sort
Selection Sort
Insertion Sort
Merge Sort
Quick Sort
Heap Sort
Linear Search
Binary Search
Jump Search
BST Insert
BST Search
In-order Traversal

Breadth-First Search
Depth-First Search
Dijkstra's Shortest Path
Prim's MST
Kruskal's MST
Topological Sort (Kahn's)
Tower of Hanoi
N-Queens
Permutations (Backtracking)
Fibonacci (DP)
0/1 Knapsack
Longest Common Subsequence
Coin Change (Min Coins)

Hill Climbing
Simulated Annealing
Differential Evolution

Q-Learning

Genetic Algorithm
Particle Swarm Optimization
Ant Colony Optimization

Monte Carlo Simulation

Placeholder — future integration.

"The invisible architecture through which intelligence becomes impact."

01Foundations·Blocked Search

Jump Search

⏱ O(√n)◧ O(1)

1

3

5

7

9

11

13

15

17

19

21

23

25

0

1

2

3

4

5

6

7

8

9

10

11

12

State vector

[1,3,5,7,9,11,13,15,17,19,21,23,25]

Step 1 / 6

Speed

Speed

01Foundations

Jump Search

Blocked Search

Skip ahead by √n then linear-scan the block.

Time

O(√n)

Space

O(1)

Applications

Sorted arrays on slow storage
When random access is expensive

Reasoning Trace

Jump size = √n = 3

target19

jump3

Principle in Pseudocode

1step = √n
2jump while a[step-1] < target
3then linear scan in block

Reference implementation · python

step = int(len(a) ** 0.5)
prev = 0
while a[min(step, n) - 1] < target:
  prev = step; step += int(len(a) ** 0.5)
for i in range(prev, min(step, n)):
  if a[i] == target: return i