Step-by-Step Architecture

The Algorithm Library:
Where Algorithms Come Alive.

Step through sorting, searching, and pathfinding in a quiet, distraction-free environment. Every step is recorded for seamless time-travel, viva defense, and deep algorithmic intuition.

Live Laboratory Pulse
Bubble Sort Cycle
Fluid, calm step snapshots. No jarring flashes.

Archived DSA Collections

Choose an algorithm below to open its dedicated interactive player.

Bubble Sort

Sorting

Repeatedly swaps adjacent elements if out of order until the largest value bubbles to the end.

Worst: O(n²) Space: O(1) Stable

Selection Sort

Sorting

Repeatedly scans unsorted region to select the minimum item and swaps it into place.

Worst: O(n²) Space: O(1) Unstable

Insertion Sort

Sorting

Builds a sorted array one element at a time by sliding larger items rightward.

Worst: O(n²) Best: Ω(n) Stable

Merge Sort

Sorting

Divide-and-conquer strategy dividing array in halves, recursively sorting and merging.

O(n log n) Space: O(n) Stable

Quick Sort

Sorting

Picks a pivot element and partitions array into items smaller and larger than pivot.

θ(n log n) Space: O(log n) Unstable

Heap Sort

Sorting

Transforms array into Max-Heap and repeatedly extracts the root maximum to the end.

O(n log n) Space: O(1) Unstable

Binary Search

Searching

Logarithmic search that halves the search space at every step using midpoints.

O(log n) Space: O(1) Sorted only

A* Search

Pathfinding

Heuristic-informed pathfinding using f(n) = g(n) + h(n) for optimal navigation.

Optimal Space: O(V) Heuristic

Breadth-First Search

Pathfinding

Level-by-level ripple expansion. Guarantees shortest path on unweighted graphs.

O(V + E) Shortest Path FIFO Queue

Bubble Sort

Repeatedly steps through the list, compares adjacent elements...
Comparisons: 0
Swaps / Writes: 0
Timeline Step: 0 / 0
Space: Play/Pause | ← / →: Step | R: Reset | M: Mute
Challenger
Comps: 0 Swaps: 0 Step: 0/0
Press Play or Step Forward to begin the visualization.
Custom Array:
Synchronized Pseudocode Line Highlight

    Complexity & Viva Tips

    Asymptotic
    Best-case Time: Ω(n)
    Average Time: θ(n²)
    Worst-case Time: O(n²)
    Space Complexity: O(1)
    Stable Sorting: Yes
    Student Viva Tip

    Binary Search

    Repeatedly divides the search interval in half...
    Comparisons: 0
    Status: Ready
    Timeline Step: 0 / 0
    L: Low M: Mid H: High ✓: Found
    Press Play or Step Forward to begin the search trajectory.
    Synchronized Pseudocode Interval Halving

      Complexity & Viva Tips

      Asymptotic
      Best-case Time: Ω(1)
      Average Time: θ(log n)
      Worst-case Time: O(log n)
      Space Complexity: O(1)
      Viva Question & Key Invariant

      Breadth-First Search (BFS)

      Explores all neighbor nodes at present depth before moving deeper...
      Nodes Visited: 0
      Shortest Path Length: 0
      Search Duration: 0 ms
      Start Target Wall Visited Path
      Swipe horizontally on mobile to pan the grid canvas
      Tip: Click and drag across the grid to build walls. Drag the green start or red target flags to reposition them!
      Algorithm Pseudocode Traversal Logic

        Complexity & Viva Tips

        Graph Metrics
        Time Complexity: O(V + E)
        Space Complexity: O(V)
        Guarantees Shortest Path: Yes (Unweighted)
        Viva Concept & Key Invariant

        Algorithm Comparison Matrix

        Comprehensive asymptotic reference across all archived sorting, searching, and pathfinding algorithms.
        Algorithm Category Best Case Average Case Worst Case Aux Space Stable / Optimal Viva Takeaway Action
        Question 1 of 10 Score: 0
        Sorting Interactive Exam Mode

        Loading quiz question...

        Correct Educational Rationale:

        Assessment Concluded

        8 / 10 (80%)

        Senior Algorithm Fellow

        Exceptional mastery! You understand algorithmic invariants, worst-case degradations, and graph optimalities.