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 python/algorithms, what is the time complexity of pop(i) for lists (e.g. you have l = [1,2,3,4,5], what is big-O of doing: l.pop(0)?
Answer
O(n)
^^ this is python sacrifice to make index assignment O(1)

Question
In python/algorithms, what is the time complexity of pop(i) for lists (e.g. you have l = [1,2,3,4,5], what is big-O of doing: l.pop(0)?
Answer
?

Question
In python/algorithms, what is the time complexity of pop(i) for lists (e.g. you have l = [1,2,3,4,5], what is big-O of doing: l.pop(0)?
Answer
O(n)
^^ this is python sacrifice to make index assignment O(1)
If you want to change selection, open document below and click on "Move attachment"

pdf

owner: kkhosravi - (no access) - ProblemSolvingwithAlgorithmsandDataStructures.pdf, p59

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.