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, when determining algorithm effeciency, time effeciency is measure how?
Answer
counting the number of operations (using the most significant chuck as the Big-O time complexity, e.g. n^2 + n + 2 operations = O(n^2)

Question
In algorithms, when determining algorithm effeciency, time effeciency is measure how?
Answer
?

Question
In algorithms, when determining algorithm effeciency, time effeciency is measure how?
Answer
counting the number of operations (using the most significant chuck as the Big-O time complexity, e.g. n^2 + n + 2 operations = O(n^2)
If you want to change selection, open document below and click on "Move attachment"

pdf

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

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.