quxt
Version:
Lodash but OVERPOWERED!
24 lines (20 loc) • 548 B
JavaScript
function shellSort(items) {
let interval = 1
while (interval < items.length / 3) {
interval = interval * 3 + 1
}
while (interval > 0) {
for (let outer = interval; outer < items.length; outer++) {
const value = items[outer]
let inner = outer
while (inner > interval - 1 && items[inner - interval] >= value) {
items[inner] = items[inner - interval]
inner = inner - interval
}
items[inner] = value
}
interval = (interval - 1) / 3
}
return items
}
module.exports = shellSort