Login or Create an Account to view the mark scheme, comment, and add to a test
With respect to Big O notation, choose the time complexity of searching for the smallest element in an unsorted array.
O(log n)
O(n log n)

Multiple Choice1 MarkPremium
0 Uses8 Views0 Likes