An unsorted array has this property that every element in it is at most $d$ distance from its position in the sorted version of the array (where $d$ is a positive integer smaller than the size of the array).
Which among the following algorithms is best suited to sort this array?
- Insertion Sort
- Quick Sort
- Heap Sort
- Merge Sort