Time Complexity Dijkstra -
if complexity of algorithm o(evlogv). given e=20000
, v=1000
.
how many seconds take execute?
20000 * 10000 log 10000 = 800000000
what 800000000
means ?
big-o notation way of describing how many times set of operations performed. doesn't relate directly time on machine or instructions required operate on machine. so, 800000000 number of times set of operations performed when have data set of size e=20000 , v=10000.
Comments
Post a Comment