Revision as of 13:08, 30 December 2013 edit Qwertyus (talk \| contribs) Extended confirmed users 31,640 edits →Python Implementation: remove; there's already some C code ← Previous edit		Revision as of 13:11, 30 December 2013 edit undo Qwertyus (talk \| contribs) Extended confirmed users 31,640 edits →Analysis: remove section; all OR and not very convincing Next edit →
Line 202: } </source> ~~==Analysis==~~ ~~[[Image:Library sort graph.png\|Library sort runtime for decreasing sequences]]~~ ~~[[Image:Insertion sort graph.png\|Insertion sort runtime for decreasing sequences]]~~ The two graphs show the performance of library sort and insertion sort for the same inputs. It is quite clear that library sort takes O(n log n) time approximately while the insertion sort takes O(n<sup>2</sup>) time. == References ==

Library sort: Difference between revisions