Part of list:

Why do we need (efficient) algorithms?

Why do we need (efficient) algorithms?[ Edit ]

A computer can only do a limited number of operations such as additions, multiplications, etc in a given time. Usually, this number is approximately a billion operations per second. Hence, if we want our algorithm to finish executing in a second or so, then we need to make sure that the total amount of work we are asking it to do is less than a billion operations. Example of operations are addition, multiplication, assigning a value to a variable, and so on.

Here is a tutorial on Computational Complexity by Michal Forišek, one of the organizers of IOI. I love the first couple of sections titled ** Why is it important?** and

Finally, once you understand the rationale behind asymptotic notation and computational complexity, here is a simple **video** explaining the concept in detail.

If you get stuck, shoot your questions. If you find other great resources, do share with everyone.

Read more…(191 words)

Mark as completed

Also part of lists:

Next

Quiz: Analyzing code complexity, estimating runtime and memory usage

About the contributors:

Keshav DhandhaniaFormer TopCoder India rank #1, IOI medalist

98%

Anant JainCo-founder, Commonlounge

2%

Loading…

Have a question? Ask here…

Post

Part of list:

Why do we need (efficient) algorithms?

Contributors

Keshav DhandhaniaFormer TopCoder India rank #1, IOI medalist

98%

Anant JainCo-founder, Commonlounge

2%

Ready to join our community?

Sign up below to automatically get notified of new lists, get **reminders** to finish ones you subscribe to, and **bookmark** articles to read later.

Continue with Facebook

— OR —

Your Full Name

Email address

I have an account. Log in instead

By signing up, you agree to our Terms and our Privacy Policy.