ts-ds-tool/src/algorithms/sort/shellSort/shellSort.ts

Data structure and algorithm of TypeScript

import { swap } from "../../../util";
export function shellSort<T>(arr: Array<T>, key?: keyof T){
    if (!arr || !arr.length){
        return arr;
    }
    const len = arr.length;
    let i = 1;
    while (Math.floor(len / (2 * i))){
        const quotient = Math.floor(len / (2 * i));
        for (let j = 0; j < 2 * i; j++){
            let currentIndex = j;
            while (currentIndex + quotient < len){
                const current = arr[currentIndex],
                    quotientNext = arr[currentIndex + quotient];
                const condition = key ?  quotientNext[key] < current[key] : quotientNext < current;
                // tslint:disable-next-line:curly
                if (condition) swap(arr, currentIndex, currentIndex + quotient);
                currentIndex += quotient;
            }
        }
        i++;
    }
}