How many swaps does Selection Sort perform in the worst case?O(n)O(n log n)O(n^2)O(log n)

What is the worst case complexity of selection sort? a) O(nlogn) b) O(logn) c) O(n) d)

If the array had been sorted in descending order initially, how many swaps would the Bubble Sort perform?

Assume we want to sort integers into ascending order. To sort a small array that contains 42, 17, selection sort will perform one swap, or three assignments. How many assignments will it perform to sort an array that contains these 10 elements: 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 ? Group of answer choices 15 18 24 27 63

Given list [16, 32, 35, 99, 37, 42, 67, 88, 68], how many swaps are needed to sort the list?

What is the primary disadvantage of Selection Sort?It requires additional memory.It is unstable.It is difficult to implement.It has a high time complexity for large arrays.