tstruct
Version:
Data structures & basic algorithms library
53 lines (52 loc) • 1.78 kB
JavaScript
;
var __read = (this && this.__read) || function (o, n) {
var m = typeof Symbol === "function" && o[Symbol.iterator];
if (!m) return o;
var i = m.call(o), r, ar = [], e;
try {
while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
}
catch (error) { e = { error: error }; }
finally {
try {
if (r && !r.done && (m = i["return"])) m.call(i);
}
finally { if (e) throw e.error; }
}
return ar;
};
var __spread = (this && this.__spread) || function () {
for (var ar = [], i = 0; i < arguments.length; i++) ar = ar.concat(__read(arguments[i]));
return ar;
};
Object.defineProperty(exports, "__esModule", { value: true });
exports.QuickSelect = void 0;
var CompareFunction_1 = require("../CompareFunction");
function QuickSelect(elements, kth, compareFunction) {
if (compareFunction === void 0) { compareFunction = CompareFunction_1.ascendingCompareFunction; }
if (kth >= elements.length) {
return undefined;
}
var arr = __spread(elements);
var find = function (start, end) {
if (start === void 0) { start = 0; }
if (end === void 0) { end = elements.length - 1; }
var pivot = arr[end];
var i = start - 1;
for (var j = start; j <= end; j++) {
if (compareFunction(pivot, arr[j]) <= 0) {
i++;
var tmp = arr[j];
arr[j] = arr[i];
arr[i] = tmp;
}
}
if (kth == i)
return arr[i];
if (kth < i)
return find(start, i - 1);
return find(i + 1, end);
};
return find();
}
exports.QuickSelect = QuickSelect;