Tap here to switch tabs
Problem
Submissions

Problem: Cyclic Sort

Cyclic Sort asks you to sort an array of distinct integers in place. Every value is between one and the array's length, using linear time and constant extra space.

Statement

You are given an integer array, nums of size nn, where each number is distinct and falls within the range [1,n][1, n]. Your task is to sort the array in place while ensuring a time complexity of O(n)O(n) and using only O(1)O(1) extra space.

Constraints:

  • n==n == nums.length

  • 1≤1 \leq nn ≤103\leq10^3

  • Each element in nums is unique and within the range [1,n][1, n].

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Cyclic Sort

Cyclic Sort asks you to sort an array of distinct integers in place. Every value is between one and the array's length, using linear time and constant extra space.

Statement

You are given an integer array, nums of size nn, where each number is distinct and falls within the range [1,n][1, n]. Your task is to sort the array in place while ensuring a time complexity of O(n)O(n) and using only O(1)O(1) extra space.

Constraints:

  • n==n == nums.length

  • 1≤1 \leq nn ≤103\leq10^3

  • Each element in nums is unique and within the range [1,n][1, n].