Pass

Well done Anton!

SORRII Anton. I'm stepping back from my initial harsh comment below. I've come to realise that my assignment instructions are open for missinterpretation. Since you made a good job of completing parts of the assignment, you gain a Pass.

Not only did you give me pesky programming for depricated estetare, you pushed substandard formatting and poor inline documentation; not good; not worthy. And where is your implementation of selection sort and merge sort?

Lets comprimise; I'll give you Pass if you simply submit an implementation of selection sort and merge sort, without the necessary visualisation logic for them.

Lastly, nice pancake sort.

Notes on your code:

I notice that you do not make use of the full extent of javascript for-loops.

Standard for-loop:

for (let i = 0; i < array.length; i++) {/*...*/}

for-loop over index range:

for (let i in array) {/*...*/}

for-loop over elements:

for (let elem of array) {/*...*/}

Have you considered using arithmetic values in arithmetic expressions to avoid code douplication?

Your code:

if (x%2 == 0) {
    for (let i = 0;i <= ofiInsert[x]; i++) {
        fillNumberRed(actionsInsert[x][i],i);
    }
}
else {
    for (let i = 0;i <= ofiInsert[x-1]; i++) {
        fillNumberRed(actionsInsert[x][i],i);
    }
}

No douplications:

for (let i = 0;i <= ofiInsert[x - (x % 2)]; i++) {
    fillNumberRed(actionsInsert[x][i],i);
}

Nice! I actually did not know of this syntax, [array[start], array[i]] = [array[i], array[start]];.

このissueではファイル、テスト、またはエントリポイントが一切指定されておらず、課題へのフィードバックとJavaScriptの例で構成されています。selection-sortとmerge-sortの要求には取り消し線が引かれており、issueではPassが与えられているため、現時点で確認すべき完了目標はありません。