Do you want BuboFlash to help you learning these things? Or do you want to add or correct something? Click here to log in or create user.


  • Presentation
  • Question
  • Answer

Question
In algorithms, the big-O time complexity order from fastest to slowest is: O(1) , [...] , O(n), O(nLogn), O(n^2), O(n^3), O(2^n)
Answer
O(logn)

Question
In algorithms, the big-O time complexity order from fastest to slowest is: O(1) , [...] , O(n), O(nLogn), O(n^2), O(n^3), O(2^n)
Answer
?

Question
In algorithms, the big-O time complexity order from fastest to slowest is: O(1) , [...] , O(n), O(nLogn), O(n^2), O(n^3), O(2^n)
Answer
O(logn)
If you want to change selection, open document below and click on "Move attachment"

pdf

owner: kkhosravi - (no access) - PYTHON_DATA_STRUCTURES_AND_ALGORITHMS.pdf, p95

Summary

statusnot learnedmeasured difficulty37% [default]last interval [days]               
repetition number in this series0memorised on               scheduled repetition               
scheduled repetition interval               last repetition or drill

Details

No repetitions

Discussion

Do you want to join discussion? Click here to log in or create user.