3 ms·
Skiena has a great table in his algorithms book mapping time complexity to hypothetical times for different input sizes. For n of 10^9, where lgn takes 0.03 us
by sn9 1y ago
Skiena has a great table in his algorithms book mapping time complexity to hypothetical times for different input sizes.
For n of 10^9, where lgn takes 0.03 us and n takes 1 s, nlgn takes 29.9 s and n^2 takes 31.7 years.
- swyx 1y agomore from table please?
- johnisgood 1y agoI would rather have the table and related content. Name of the book?
- EdwardCoffin 1y agoIt's probably The Algorithm Design Manual 2ed by Steven S. Skiena, figure 2.4 The second table on this [1] page is pretty similar, though not the same. [1] https://a1120.cs.aalto.fi/notes/round-efficiency--bigoh.html https://a1120.cs.aalto.fi/notes/round-efficiency--bigoh.html