http://codereview.chromium.org/4065/diff/1/2 File src/array.js (right):
http://codereview.chromium.org/4065/diff/1/2#newcode651 Line 651: // Standard in-place HeapSort algorithm. I think it is Quicksort now. http://codereview.chromium.org/4065/diff/1/2#newcode697 Line 697: var length = ToUint32(this.length); Maybe using insertion sort for small arrays (<10 elements ) would be good. It is faster than Quicksort for small arrays. http://codereview.chromium.org/4065 --~--~---------~--~----~------------~-------~--~----~ v8-dev mailing list [email protected] http://groups.google.com/group/v8-dev -~----------~----~----~----~------~----~------~--~---
