Function sort

w3/d3/solutions/recursion-pt4/problems/13-sort.js:24–48

Write a recursive function called `sort` that takes an array of integers, `nums` and returns an array containing those integers sorted from least to greatest. Your function should accept a default argument called `sorted` which holds the currently sorted elements. Each recursive step should add the

(nums, sorted = [])

***********************************************************************/

function sort(nums, sorted = []) {
    //!!START
    // Base case: all numbers are in the sorted array
    if (nums.length == 0) {
        return sorted;
    }

    // Find the smallest number in the nums array
    let minIndex = 0;
    for (let i = 1 ; i < nums.length ; i++) {
        if (nums[i] < nums[minIndex]) {
            minIndex = i;
        }
    }

    // Add the smallest number to the end of the sorted array
    sorted.push(nums[minIndex]);

    // Remove the smallest number from the nums array
    nums.splice(minIndex, 1);

    // Recursively call sort with the new array
    return sort(nums, sorted);
    //!!END
}

/**************DO NOT MODIFY ANYTHING UNDER THIS LINE*****************/
module.exports = sort;