All Questions

1 Questions

0

Votes

0

Replies
Please explain the solution of 1st problem in Insertion sort
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.