The one-sentence version of everything

• Array: numbered boxes in a row, instant access by number.
• String: an array of letters.
• Linked List: a chain of clues, each pointing to the next.
• Stack: last in, first out — like a pile of pancakes.
• Queue: first in, first out — like a checkout line.
• Linear Search: check everything, one by one.
• Bubble Sort: repeatedly swap neighbors until sorted.
• Binary Search: cut the possibilities in half every guess.
• Recursion: solve a smaller version of the same problem.
• Hash Map: instant lookup via a coat-check ticket.
• Tree: a family tree — one path to every relative.
• BST: a tree where left is always smaller, right is always bigger.
• Merge/Quick Sort: divide the mess into tiny pieces, then combine/sort smartly.
• Graph: friendships that can loop around, unlike a family tree.
• BFS/DFS: explore ring-by-ring, or dive deep-first.
• Dynamic Programming: remember answers so you never redo work.
• Greedy: always take the best option available right now.
• Backtracking: try, and undo if it doesn't work out.
• Heap: always know the most urgent item instantly.
• Union-Find: quickly track which friend groups have merged.
• Trie: a tree of letters, for lightning-fast prefix lookups.
• Dijkstra: GPS logic — always expand the closest place first.
• Topological Sort: one valid order that respects all the "do this before that" rules.