ITPUB

May 2, 2017 · Fundamentals

Master Core Algorithms: Sorting, Graph Traversal, Greedy & Complexity Basics

This guide presents concise explanations of essential algorithms—including quick sort, merge sort, bucket and radix sorts, depth‑first and breadth‑first searches, shortest‑path and minimum‑spanning‑tree methods—along with their stability, time‑complexity analyses, greedy strategies, bit‑manipulation tricks, and asymptotic notation, and points to a GitHub repository for reference implementations.