Sorting Algorithm
/ˈsɔːtɪŋ ˈælɡərɪðəm/
Definition
An algorithm reordering elements in a collection — merge sort is O(n log n); quicksort averages O(n log n) but degrades to O(n²).
Example in context
"Interview tip: know merge sort top-down — it's O(n log n) stable and interviewers ask it often."
Practice this term
Master Sorting Algorithm in context by working through exercises in the Data Structures & Algorithms module. You'll see the term used in real engineering scenarios with multiple-choice, fill-in-the-blank, and matching drills.