Difference between revisions of "TADM2E 1.25"
From Algorithm Wiki
(Redirected page to UNTV) |
|||
| Line 1: | Line 1: | ||
| − | + | 1. If there are 10 times as many items, and it is proportional to <math>n^2</math>, it will take <math>10^2</math> times as long or 100 seconds. | |
| + | 2. If it proportional to <math>nlogn</math>, it will take <math>(10^4.log_{2} 10^4) / (10^3.log_{2} 10^3)</math> as long or about 13.33 seconds. | ||
Latest revision as of 00:47, 1 August 2020
1. If there are 10 times as many items, and it is proportional to $ n^2 $, it will take $ 10^2 $ times as long or 100 seconds. 2. If it proportional to $ nlogn $, it will take $ (10^4.log_{2} 10^4) / (10^3.log_{2} 10^3) $ as long or about 13.33 seconds.
