Sorted Linked List Quiz
Question 1 |
How long does it take to find the maximum value, expressed in Big-O notation, stored in a Sorted Linked List?
O(n^2) | |
O(n log n) | |
O(n) | |
O(1) | |
O(n!) |
There is 1 question to complete.
Question 1 |
O(n^2) | |
O(n log n) | |
O(n) | |
O(1) | |
O(n!) |