2 * Copyright (C) 2011 Google Inc. All rights reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions are
8 * * Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * * Redistributions in binary form must reproduce the above
11 * copyright notice, this list of conditions and the following disclaimer
12 * in the documentation and/or other materials provided with the
14 * * Neither the name of Google Inc. nor the names of its
15 * contributors may be used to endorse or promote products derived from
16 * this software without specific prior written permission.
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 Object.defineProperty(Array.prototype, "sortRange", { value:
33 function(comparator, leftBound, rightBound, k)
35 function swap(array, i1, i2)
38 array[i1] = array[i2];
42 function partition(array, comparator, left, right, pivotIndex)
44 var pivotValue = array[pivotIndex];
45 swap(array, right, pivotIndex);
46 var storeIndex = left;
47 for (var i = left; i < right; ++i) {
48 if (comparator(array[i], pivotValue) < 0) {
49 swap(array, storeIndex, i);
53 swap(array, right, storeIndex);
57 function quickSortFirstK(array, comparator, left, right, k)
61 var pivotIndex = Math.floor(Math.random() * (right - left)) + left;
62 var pivotNewIndex = partition(array, comparator, left, right, pivotIndex);
63 quickSortFirstK(array, comparator, left, pivotNewIndex - 1, k);
64 if (pivotNewIndex < left + k - 1)
65 quickSortFirstK(array, comparator, pivotNewIndex + 1, right, k);
68 if (leftBound === 0 && rightBound === (this.length - 1) && k === this.length)
69 this.sort(comparator);
71 quickSortFirstK(this, comparator, leftBound, rightBound, k);