Which sorting algorithm works by repeatedly dividing the unsorted list into two halves and merging them back together?Group of answer choicesInsertion SortMerge SortBubble SortSelection Sort

Which of the following is an out-of-place sorting algorithm?Group of answer choicesInsertion sortBubble sortAll of theseMerge sort

Which of the following sorting algorithms is not a comparison-based algorithm?Group of answer choicesInsertion sortQuick SortBubble SortRadix Sort

Which sorting algorithm is based on the principle of repeatedly selecting the minimum element from the unsorted part of the array and placing it in its correct position?Group of answer choicesSelection SortMerge SortBubble SortInsertion Sort

Which sorting algorithm is generally considered the most efficient for sorting a doubly linked list?Group of answer choicesHeap sortBubble sortMerge sortInsertion sort

The "divide and conquer" technique is commonly used in which sorting algorithm?Select one:a. Quick Sortb. Bubble Sortc. Merge Sortd. Selection Sort