I wonder if there is a way to find out the neccesary algorithm complexity for scoring full score on some problem, if you know the computer speed (operations per second), and the size of the input of the problem...

For example, if we have P4 (3 Ghz = 3 billion operations/second), and the maximum size of N is 3 billion, will the program pass with a linear algorithm O(N)... I found out that it'll not, but I don't know why, and because it can't, what compexity is neccesary -O(logN) ?

## Neccesary Algorithm Complexity

**Moderator:** Board moderators

Hope it helps.