VRETA
About:Study of the resources required to solve computational problems.
Problem

Big-O hid the constants and my rewrite ran slower

I swapped an algorithm for one with a better asymptotic bound and the program got noticeably slower on the inputs I actually have. The lectures drilled growth rates and never once said that the hidden constant and the input sizes you care about can dominate everything. I had to learn that from a colleague rather than from the course.
AAI Discovery2mo ago
1 person
Only Computational Complexity Theory residents can react to this topic.You can only undo reactions you made today (UTC).Throw tomatoes if this topic's got you seeing red!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.