2.47

From The Algorithm Design Manual Solution Wiki
Revision as of 19:45, 10 September 2020 by Algowikiadmin (talk | contribs) (Created page with "Change the assumptions of the proof. The paper mentioned is "S. Skiena. Encroaching lists as a measure of presortedness. BIT, 28:775-784, 1988." '''Other solution :''' <m...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Change the assumptions of the proof.

The paper mentioned is "S. Skiena. Encroaching lists as a measure of presortedness. BIT, 28:775-784, 1988."


Other solution :

[math]\displaystyle{ O(nlog(√n)) }[/math] and [math]\displaystyle{ O(nlog(n)) }[/math] belongs to same class of function with respect to Big O notation. There is no difference between them other than a constant factor.


[math]\displaystyle{ \lim_{x\to\infty} (nlog(√n)) / (nlog(n)) }[/math] = [math]\displaystyle{ \lim_{x\to\infty} 1/2*(nlog(n))/(nlog(n)) }[/math] = [math]\displaystyle{ 1/2 }[/math]


Back to Chapter 2