Home Forum Please explain the solution of 1st problem in Insertion sort

Please explain the solution of 1st problem in Insertion sort

0

I see that 1.000001^n is treated as highest value but the value will always be one. So please help me in understanding the answer.
Data structures

Answers

0

Admin Posted on Dec 03, 2019 05:43 PM

Please refer the following link to understand the problem: https://cs.stackexchange.com/questions/6711/when-does-1-00001n-exceed-n100001

Reply