What is the best case and worst case complexity of selection sorting? 2024-8-27 12:39 | 20 | 0 | A1 14 Words | Few seconds Answer: O(n^2) for both, where n is the length of the list A1Selection SortingSolvedSorting