What is the best case complexity (in terms of the number of comparisons) for selection sort, sorting an array of n eleme
Posted: Mon Mar 21, 2022 4:46 pm
What is the best case complexity (in terms of the number of comparisons) for selection sort, sorting an array of n elements? O O(nlog(n)) O O(n3) O(n) O O(log(n)) O O(n2)