option C,D
insertion sort: you must have played cards .its better to sort a hand rank wise if its not sorted .if its sorted already then no need to sort it
quick sort:here the pivot element plays an important role.if the array is sorted and your algorithm chooses the first element as pivot then you are going to get a worse case scenario
selection sort:if its already sorted or not sorted it doesn't matter it always takes O(n^2)
merge sort:it too takes O(nlogn) time in any case