non‑recursive

Selected Java Interview Questions

Feb 13, 2020 · Fundamentals

Quick Sort: Overview, Naïve Implementation, Optimizations, and Non‑Recursive Version

This article explains the quick sort algorithm, covering its basic divide‑and‑conquer principle, a naïve C implementation, improvements such as two‑way partitioning, random and median‑of‑three pivot selection, and a non‑recursive version using an explicit stack, with full source code examples.