Which of the following is NOT an O(n2) sorting algorithm? Heap Sort Bubble Sort Insertion Sort Selection Sort

Conceptual Question:   Can you explain the following Sorting Algorithms and provide an example of how they work and function? RadixBucketHeapMerge   What are their complexities and how fast are they?

11 Which algorithm does not necessarily select an element to put in its final position after sort for one single time? O A Quick sort OB Bubble sort OC Merge sort OD Heap sort 1 The time complexity of the select sort in the best case is O (n) 2 Among all sorting algorithms, quick sort is the fastest and requires the least auxiliary storage space

How to solve this question