CS 331 Design and Analysis of Algorithms

: An algorithm actually may be lucky on an input and finish in less number of steps, note the tree. Max height of the tree is ( log2(N!) Note 2: You may, of course, develop algorithms with worse complexity – insertion sort takes O(N2). O(N log N) is the best worst-case complexity you could expect from any comparison-based sort algorithm! ................
................