9. Cyclic Sort

Medium

Topics

Helpful tools to learn & understand

Visualize LogicActive Simulator

Watch key transitions, pointers, and variables update step-by-step.

Open

Check Solutions

Read clean, documented implementations across multiple patterns.

View Code

Thinkpad (Draw & Note)

Sketch diagrams on an infinite canvas and draft notes directly inline.

Draw

Example 1:

Input: nums = [3, 1, 5, 4, 2]

Output: [1, 2, 3, 4, 5]

Explanation: The algorithm iterates through the array and swaps elements until each element is at its correct index.

Example 2:

Input: nums = [2, 6, 4, 3, 1, 5]

Output: [1, 2, 3, 4, 5, 6]

Explanation: The algorithm places '2' at index 1, '6' at index 5, and so on, until the array is sorted.

Example 3:

Input: nums = [1, 5, 6, 4, 3, 2]

Output: [1, 2, 3, 4, 5, 6]

Explanation: Similar to the previous example, the algorithm swaps elements until sorted.

Example 4:

Input: nums = [5, 4, 3, 2, 1]

Output: [1, 2, 3, 4, 5]

Explanation: The array is reverse sorted initially, requiring multiple swaps to achieve the sorted order.

Example 5:

Input: nums = [1]

Output: [1]

Explanation: A single-element array is already sorted.

Constraints:

•
•
•

Time Complexity

O(n)

Space Complexity

O(1)