Question: 1) What is the average time complexity for quick sort to sort a list of n elements? O(n) O(lg n) O(log n) O(n 2 )
1) What is the average time complexity for quick sort to sort a list of n elements?
| O(n) | ||
| O(lg n) | ||
| O(log n) | ||
| O(n2) | ||
| O(n lg n) | ||
| O(1) |
2) What is the time complexity for merge sort to sort a list of n elements?
| O(n) | ||
| O(lg n) | ||
| O(log n) | ||
| O(n2) | ||
| O(n lg n) | ||
| O(1) |
3) What is the time complexity for selection sort to sort a list of n elements?
| O(n) | ||
| O(lg n) | ||
| O(log n) | ||
| O(n2) | ||
| O(n lg n) | ||
| O(1) |
4) What is the time complexity of an operation on a doubly linked list that appends an element to the end of the list?
| O(n) | ||
| O(lg n) | ||
| O(log n) | ||
| O(n2) | ||
| O(n lg n) | ||
| O(1) |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
