Bubble sort only swaps adjacent pairs (thus "bubble", visualized the values "bubble up" to their correct spot) and is often abbreviated so that the inner loop runs on shorter segments (because the smallest or largest value, depending on how you write it, has been placed, no need to check that section again). this algorithm will swap non-adjacent pairs, making it more like insertion sort.
just tested example picture in tweet by ms azure facial recognition service and it worked pretty well, idk maybe test picture is just marketing crap, wanna see real world example of this tech before believing in it
That feeling when you are pressing SoftIce popup hotkey and guessing will application survive or not. then your computer just freeze :D just old good times
V looks really promising like something between Go and Rust. but there is still so much work to do, ecosystem are not cheap in terms of resources and community. nice looking "another one" language may be not enough to get succeed