A given problem, A given platform, for the two algorithms to solve the problem of the same A and B
1, if A time complexity than B is big, the execution time must be longer than B?
2, if the same time complexity, the execution time is the same?
Just learning, a great god about them

CodePudding user response:

refer to the original poster m0_463737261616 response:

A given problem, A given platform, for the two algorithms to solve the problem of the same A and B
1, if A time complexity than B is big, the execution time must be longer than B?
2, if the same time complexity, the execution time is the same?
Just learning, a great god tell me

Feel no comparability, the algorithm of the execution time and algorithm of step B step execution time may be different, bigger O, only than the growth rate, than not to come out different algorithms of the execution time?