Given an array in which every element is at most k positions away from its sorted position (a k-sorted array), sort it efficiently. Also be ready to compare insertion, merge and quick sort.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.