Which of the following sorting methods will be the best if number of swapping done is the only measure of efficiency I am getting Bubble sort , is it right ?

(A) Insertion Sort with time complexity O(kn) (B) Heap Sort with time complexity O(nLogk) (C) Quick Sort with time complexity O(kLogk) (D) Merge Sort with time complexity O(kLogk) what is the approach of doing this question ?

Which sorting algorithm can be used to sort a random linked list with minimum time complexity ? A)mergesort B)quicksort C)radixsort D)insertionsort E)heapsort