Question: QUESTION 7 We discussed the selection sort sorting algorithm. What is the worst case time complexity of selection sort when sorting a list of




QUESTION 7 We discussed the selection sort sorting algorithm. What is the worst case time complexity of selection sort when sorting a list of n elements? o(lg n) O(n) O(n lg n) O(n) O(log n) O(1) QUESTION 8 We discussed the quick sort sorting algorithm. What is the average case time complexity of quick sort when sorting a list of n elements? O(lg n) O(n) O(n lg n) O(n) O(log n) O(1) QUESTION 9 Let list be a doubly linked list of Integers where n is the size of the list. Suppose key is an Integer and we wish to search list for key. What is the worst case time complexity of the search algorithm? O(lg n) O(n) O(n lg n) 0(n) O(log n) 0(1) QUESTION 10 Let list be a doubly linked list of Integers where n is the size of the list. We wish to append an Integer to the end of the list. What is the worst case time complexity of the append operation? O(lg n) O(n) O(n lg n) O(n) O(log n) O(1)
Step by Step Solution
3.51 Rating (164 Votes )
There are 3 Steps involved in it
The detailed ... View full answer
Get step-by-step solutions from verified subject matter experts
