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).

What is the worst case complexity of selection sort? a) O(nlogn) b) O(logn) c) O(n) d)

Which of the following sorting algorithm has the running time that is least dependant on the initial ordering of the input? Group of answer choices Selection sort Quick sort Merge sort Insertion sort

Select the correct answerWhat is the advantage of selection sort over other sorting techniques?OptionsIt requires no additional storage spaceIt works best for inputs which are already sortedIt is faster than any other sorting techniqueIt is scalable

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

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)