Cracking the Cyclic Sort Interview Pattern to Sort an Array in Place with Javascript - Part 1

In this video, we start a brand new interview pattern: cyclic sort.

This pattern is best used for problems involving arrays containing numbers in a given range. Using this pattern we can do things such as determining what order the numbers should be in, missing numbers, and duplicate numbers all with maximum linear time complexity aka O(n).

The Challenge:
Given an array of scrambled numbers from 1…n, write a function to sort the numbers in place in O(n) time without using any extra space.

Video Overview:
0:43 Pattern Overview
2:00 Problem
3:13 Approach Outline
5:22 Javascript Solution

Please subscribe to our channel :)

Join us next week for part 2 of this pattern where we’ll walk through a more challenging problem.

Additional Resources:
* Check out our tiktoks @coderbyte

[jeevankishorem]

Beautiful and simple explaination. I subscribed the channel for its similicity.

[alfredoferreira]

You did a great job explaining it, you got a new subscriber

[KaisarAnvar]

Conclusion: Correct index for 1 to N is arr [ i ] - 1. So, if ( arr [ i ] != arr [ correctIndex ] ), swap these elements. For 0 to N, each element sits on its own index location (element 0 at 0th index etc).