# Difference between revisions of "TADM2E 1.25"

From Algorithm Wiki

(Recovering wiki) |
(Recovering wiki) |
||

Line 1: | Line 1: | ||

− | 1. If there are 10 times as many items, and it is proportional to | + | 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 | + | 2. If it proportional to <math>nlogn</math>, it will take <math>10log_{2} 10</math> as long or about 33.2 seconds. |

## Revision as of 18:24, 11 September 2014

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 $ 10log_{2} 10 $ as long or about 33.2 seconds.