Bucket sort in javascript

bucketSort.js

let insertionSort = (inputArr) => {
    let length = inputArr.length;
    for (let i = 1; i < length; i++) {
        let key = inputArr[i];
        let j = i - 1;
        while (j >= 0 && inputArr[j] > key) {
            inputArr[j + 1] = inputArr[j];
            j = j - 1;
        }
        inputArr[j + 1] = key;
    }
    return inputArr;
};

function bucketSort(arr) {
    let objectOfArrays = {
        0: [],
        1: [],
        2: [],
        3: [],
        4: [],
        5: [],
        6: [],
        7: [],
        8: [],
        9: []
    }

    for (let i = 0; i < arr.length; i++) {
        let intPart = (arr[i] * 10) | 0;
        objectOfArrays[intPart].push(arr[i]);
    }

    let sortedArray = [];

    for (let i = 0; i < 9; i++) {
        sortedArray = sortedArray.concat(insertionSort(objectOfArrays[i]));
    }

    return sortedArray;
}