Analyzing algorithms

Discuss everything related to IOI here. For more general or advanced topics use CS forum.

Moderators: bristy1588, Labib

User avatar
arnob
Posts: 8
Joined: Fri Feb 24, 2012 3:19 pm

Analyzing algorithms

Unread post by arnob » Sun Jan 06, 2013 8:56 pm

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

User avatar
*Mahi*
Posts: 1175
Joined: Wed Dec 29, 2010 12:46 pm
Location: 23.786228,90.354974
Contact:

Re: Analyzing algorithms

Unread post by *Mahi* » Sun Jan 06, 2013 11:55 pm

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

User avatar
arnob
Posts: 8
Joined: Fri Feb 24, 2012 3:19 pm

Re: Analyzing algorithms

Unread post by arnob » Tue Jan 08, 2013 7:36 am

Ok....................

Post Reply