Which sorting algorithm is widely used for sorting small arrays or as a subroutine in more complex algorithms, especially when efficiency for nearly sorted arrays is crucial?Options: Pick one correct answer from belowQuick SortSelection SortMerge SortInsertion Sort

Which of the following sorting algorithms in its typical implementation gives best performance when applied on an array which is sorted or almost sorted (maximum 1 or two elements are misplaced).

Select the correct answerWhich sorting algorithm exhibits the best performance for almost sorted arrays?Options Bubble SortQuick SortMerge Sort Insertion Sort

Which sorting algorithm is often used in practice due to its stability, consistent performance for large datasets, and efficient use of memory?Options: Pick one correct answer from belowQuick SortHeap SortMerge SortRadix SortPrevSubmit MCQNext

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

If the given input array is sorted or nearly sorted, which of the following algorithm gives the best performance?Insertion sortSelection sortQuick sortMerge sort