Hi guys,
when I write an algorithm we are in generally not relating to how much time "one operation" of PC is consuming while doing this operation. would anyone please explain to me why we aren't taking that into consideration for calculating the time complexity of the algorithm?
it's significant if we have two PC with two different processors, the time is taking for the same algorithm is differently because the two processors are different .. so if the time is different we should take into consideration that option while writing an algorithm .
How should I think as "an algorithmician" who's writing an algorithm in general
thanks alot
when I write an algorithm we are in generally not relating to how much time "one operation" of PC is consuming while doing this operation. would anyone please explain to me why we aren't taking that into consideration for calculating the time complexity of the algorithm?
it's significant if we have two PC with two different processors, the time is taking for the same algorithm is differently because the two processors are different .. so if the time is different we should take into consideration that option while writing an algorithm .
How should I think as "an algorithmician" who's writing an algorithm in general
thanks alot