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·Ordered Lookup

BST Search

⏱ O(h)◧ O(1)

Step 1 / 5

Speed

Speed

01Foundations

BST Search

Ordered Lookup

Descend left/right by comparison until match.

Time

O(h)

Space

O(1)

Applications

Symbol tables
Interval trees
Database index probes

Reasoning Trace

Search for 40

target40

Principle in Pseudocode

1while node:
2 if target == node.v: return node
3 node = node.left if target < node.v else node.right

Reference implementation · python

while node:
  if node.v == target: return node
  node = node.left if target < node.v else node.right