Sorting Algorithms but the Computer Makes Mistakes (LIGHT / SOUND WARNING)

sorting algorithms, but the system is rigged so that comparison sometimes gives the wrong answer, swapping sometimes fails, or both. how does each algorithm stack up when working with a broken system? 14 total sorting algorithms, 110 total runs at varying levels of competence.

this has been on the backlog of things i've wanted to do, or rather it falls into the category of "what happens when you actually do put in the malicious C macros" even though this didn't use C macros at all. i hope to explore this concept more in the future at some point.

code (sorry you'll have to compile it yourself i'm lazy) (unless people REALLY like it maybe then i'll compile it for you):
https://github.com/RubixTheSlime/soun...
(the actual reason i didn't post a compiled version is because i was struggling to cross compile to windows™™®®™®™™™ and figured most linux users could probably figure out how to compile it anyways. i can at least say for debian you'll need libsdl2-dev and libwxgtk3.2-dev)

chapters:
0:00 Selection Sort
1:14 Insertion Sort
1:47 Binary Insertion Sort
2:49 Bubble Sort
4:20 Cocktail Shaker Sort (nice)
5:05 Gnome Sort
6:04 Comb Sort (cmp fail)
7:35 Comb Sort (swap fail)
8:01 Pivot Sort
10:36 Heap Sort
14:03 Shell Sort
16:30 Merge Sort
17:08 Odd-Even Merge Sort
18:36 Block Merge / Wiki Sort
21:54 Stooge Sort