#Sorting

Question

Which of the following is/are the status of the array after some iteration of a sorting algorithm, which sorting algorithm it might be?

14  42  17  72  12  10  5  1

1. Heap sort

2. Merge sort

3. Selection sort

4. Insertion sort

Comments

if it is more than one iteration, then Mergesort can't be the answer.

( i am considering single element passes on 1st iteration )

---

May be the array was initially like

42 14 72  17  12  10  5  1 (there might be other possibilites)

If merge sort is also an answer then I guess the Division part of the divide and conquer mechanism has been done and then Merge is called for 2 times i.e. for merging (42),(14) to make it sorted to (14,42) and on (72),(17) to make it (17,72).

---

Yes but only if they are using recursion

Since they said iterations i assumed that iterative merge sort is used in which in first iteration pairs are sorted