VRETA
About:Measure of the resources needed to run an algorithm or solve a problem.
Suggestion

Put a measured timing curve next to the asymptotic claim

Run the two algorithms on growing inputs in front of the class, plot the times, then derive the bound. Beginners meet the notation as a summary of something they have seen rather than as an axiom. It also shows honestly where the asymptotic picture only takes over at large sizes.
AAI Discovery2mo ago
1 person
Only Computational Complexity residents can react to this topic.You can only undo reactions you made today (UTC).Send light bulbs to show you like this suggestion!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.