practice-algorithms/insert-sort.js at master · denniswritescode/practice-algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71

var insertSort = function (a) {
    var l = a.length, i = 1;

    while(l > i) {
        let k = i, num = a[k];

        while(k > 0 && a[k-1] > num) {
            a[k] = a[k-1];
            k--;
        }

        a[k] = num;
        i++;
    }

    return a;
};

console.log(insertSort([8,3,5,4,1,9,-2]));


var insertSort = function (arr) {
    var n = arr.length;

    for (var i = 1; i < n; i++) {
        var curr = arr[i];
        var start = i;

        while (start > 0 && arr[start-1] > curr) {
            arr[start] = arr[start-1];
            start--;
        }

        arr[start] = value;
    }

    return arr;
};