## Analyzing algorithms

**Moderators:** bristy1588, Labib

### Analyzing algorithms

Just from curiosity.. do you guys analyze algorithms I mean test running time each time you learn an algorithm... though it is kind of like a behemoth task but still is it necessary ? ( I think I am making a fool of myself )

### Re: Analyzing algorithms

Runtime/complexity of an algorithm is an important part of algorithm, many of the problems can be solved with algorithms having complexity $O(2^n)$, but with the test data size in contest problem, most of the cases it would take months, so they are of no use. Just knowing the complexity of an algorithm is enough, as it is quite know how many calculations a general computer can make per second (around $10^6$).

Please read Forum Guide and Rules before you post.

Use $L^AT_EX$, It makes our work a lot easier!

Nur Muhammad Shafiullah | Mahi

Use $L^AT_EX$, It makes our work a lot easier!

Nur Muhammad Shafiullah | Mahi