AlgoVista

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."

02Reasoning·Constraint Backtracking

N-Queens

⏱ O(N!)◧ O(N)

Step 1 / 31

Speed

02Reasoning

N-Queens

Constraint Backtracking

Place, propagate constraints, undo on conflict.

Time

O(N!)

Space

O(N)

Applications

Constraint satisfaction
Scheduling
Puzzle solvers

Reasoning Trace

Try (0, 0)

Call stack

try(row=0, col=0)

Principle in Pseudocode

1solve(row):
2 if row == N: record solution
3 for col in 0..N:
4 if safe(row, col): place & solve(row+1); undo

Reference implementation · python

def solve(row):
  if row == N: record(); return
  for col in range(N):
    if safe(row, col):
      board[row][col] = 1
      solve(row + 1)
      board[row][col] = 0