Video solution will be uploaded soon.
Given an unsorted array where each element is at most k distance from its position in a sorted array. Which sorting algorithm can be easily modified for this and what is its time complexity? | Watch the step-by-step video solution for this NIMCET PYQ.