Sorting algorithms can be compared based on the number of comparison statements they make.Group of answer choicesTrueFalse

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

Select the correct answerBinary search can be used in an insertion sort algorithm to reduce the number of comparisons.OptionsTrueFalse

A sorting algorithms is considered stable if it Group of answer choices preserves the relative order of any two equal elements in its input preserves the relative order of most two equal elements in its input perform its operations mostly in the same memory used by its input elements can change the relative order of equal elements in its input its worst case efficiency is in O(n log n)

Which sorting algorithm uses a comparison-based approach and a custom comparator to determine the order of elements?

Which of the following statements about selection sort are true? Note that you may select multiple statements. Group of answer choices Selection sort is a stable sorting algorithm. Selection sort is an in-place sorting algorithm. Selection sort has a worst case time complexity of O(nlogn). The default implementation of selection sort is not stable. Selection sort has a worst case time complexity of O(n2).