Q14MCQ1 mark, −0.25Which one of the following in place sorting algorithms needs the minimum number of swaps?(A)Quick sort(B)Insertion sort(C)Selection sort(D)Heap sortSign in to save attempts.Show answer← PreviousNext →SolutionsDiscussionLoading…Sign in with Google