When poll is active respond at
PollEv.com​/pds
Send pds to 22333

Consider an algorithm that you are told has worst case time complexity that is O(N^3). Which of the following is also a valid (but not necessarily good) description of the worst case time complexity for this algorithm?

133
O(1)
0%
0
O(N)
0%
0
O(N^2)
1%
1
O(N^(1/2))
0%
0
O(N^(N^1/2))
15%
20
O(10*N^3)
84%
112
Powered by