algorithm_visualizer/animations.js at master · sonutiwari/algorithm_visualizer · 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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
function getSequencialSearchAnimations(searchNumber, array) {
    let animationArr = []
    for (let i = 0; i < array.length; ++i) {
        if (searchNumber === array[i]) {
            animationArr.push({
                pos: i,
                found: true,
            })

            return animationArr
        } else {
            animationArr.push({
                pos: i,
            })
        }
    }
    animationArr.push({
        pos: array.length - 1,
        found: false
    })

    return animationArr
}

// Algorithms for animations
function getBinarySearchAnimations(searchNumber, sortedArray) {
    let animationArr =  []

    let lowIndex = 0
    let highIndex = sortedArray.length - 1
    let midIndex
    animationArr.push({
        lowIndex,
        highIndex,
        status: 'compare',
    })
    while (lowIndex <= highIndex) {
        midIndex = Math.floor((lowIndex + highIndex) / 2)
        animationArr.push({
            midIndex,
            status: 'select'
        })
        if (sortedArray[midIndex] == searchNumber) {
            animationArr.push({
                midIndex,
                status: 'found'
            })
            return animationArr
        } else if (sortedArray[midIndex] < searchNumber) {
            lowIndex = midIndex + 1
            animationArr.push({
                lowIndex,
                highIndex,
                status: 'compare',
            })
        } else {
            highIndex = midIndex - 1
            animationArr.push({
                lowIndex,
                highIndex,
                status: 'compare',
            })
        }
    }
    animationArr.push({
        lowIndex,
        midIndex,
        highIndex,
        status: 'not-found',
    })
    return animationArr;
}

function getBubbleSortAnimations(inputArr) {
    let animationArr = []
    let len = inputArr.length;
    let swapped;
    do {
        swapped = false;
        for (let i = 0; i < len - 1; i++) {
            animationArr.push({
                posI: i,
                posJ: i + 1,
                status: 'compare',
            })
            if (inputArr[i] > inputArr[i + 1]) {
                animationArr.push({
                    posI: i,
                    posJ: i + 1,
                    status: 'swap',
                })
                let tmp = inputArr[i];
                inputArr[i] = inputArr[i + 1];
                inputArr[i + 1] = tmp;
                swapped = true;
            }
        }
    } while (swapped);
    return animationArr;
}

function getSelectionSortAnimations(inputArr) {
    let animationArr = []
    let len = inputArr.length;
    for (let i = 0; i < len; i++) {
        let min = i
        animationArr.push({
            min: i,
            status: 'select-min',
        })
        for (let j = i + 1; j < len; j++) {
            animationArr.push({
                min,
                j,
                status: 'compare'
            })
            if (inputArr[min] > inputArr[j]) {
                animationArr.push({
                    min: j,
                    status: 'select-min',
                })
                min = j
            }
        }

        if (min !== i) {
            animationArr.push({
                min,
                i,
                status: 'swap'
            })
            let tmp = inputArr[i]
            inputArr[i] = inputArr[min]
            inputArr[min] = tmp
        }
    }
    return animationArr
}