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

Which of the following sorting algorithms has best case time complexity of O(nlog(n))?Selection SortInsertion SortQuick SortBubble SortI don't know

Which of the following algorithms has a worst case complexity of O(n log2n)? A. selection sort B. merge sort C. bubble sort D. insertion sort E. none of the above

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

What is the best and worst case complexity of ordered linear search?O(nlogn), o(logn)O(logn), O(nlogn)O(n), O(1)O(1), O(n)

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