Bash DSA
A lightweight execution-visualization book.
Arrays and Iteration
Array Sum (Linear Scan)
Find Maximum
Reverse Array In Place (Two Pointers)
Linear Search
Two-Sum with Hash Lookup
Sorting
Bubble Sort
Selection Sort
Insertion Sort
Merge Sort (Top-Down)
Quick Sort (Lomuto)
Searching
Binary Search (Iterative)
Binary Search (Recursive)
Binary Search First Occurrence
Linked Structures
Linked List
Traverse and Print
Insert at Head
Delete by Value
Linked List
Stacks and Queues
Stack Push/Pop
Stack
Queue Enqueue/Dequeue
Queue from Two Stacks
Hash Tables
Hash Table
First Non-Repeating Value
Group by Key
Trees
Build a Binary Tree
Preorder Traversal
Tree
Level-Order Traversal
BST Insert
BST Search
08-heaps
Min-Heap Insert (Sift Up)
Min-Heap Pop (Sift Down)
Top-K with a Heap
Graphs
Build a Graph as an Adjacency List
Graph
Depth-First Search (Recursive)
Shortest Path (Unweighted, via BFS)
Recursion and Dynamic Programming
Recursion
DP
Coin Change (Bottom-Up)
0/1 Knapsack (Small)