Cyclic Sort

Explore how to implement the cyclic sort algorithm to sort an array of distinct integers within the range 1 to n efficiently. Understand the approach to achieve O(n) time complexity and O(1) extra space while applying this technique for problems like missing numbers and detecting corrupt pairs.