How are Selection Sort and Quicksort similar?

They can both swap non-adjacent records
  • They are both O(n \log n) sorts
  • They both use divide-and-conquer
  • Both have quadratic average case time

Does Selection Sort use divide-and-conquer? No.

Can Selection Sort run in O(n \log n) time? No.

How long does Quicksort need in the average case?

O(n \log n)