What is a big-O estimate of the complexity, specifically in terms of the number of comparisons, for the selection sort algorithm when sorting an array of n elements?

Q&A Education