Just because you start slow doesn't mean you'll be last. Don't doubt yourself when you need time.
2026-11-17 03:27:36
12
SI - K :
Merge sort
2026-11-17 09:53:59
2
PoKeLan10 :
try bogo sort
2026-11-17 01:23:27
7
hlpoi :
quicksort is a little slower because it has a worst case complexity of O(n²) and mergesort has O(n Log n). Quicksort is usually faster because it has better cache locality because it works in place. of course cache locality plays absolutely no role if you artificially slow everything down like in this example. For reference on a M4 Pro you could sort 35 million numbers in a second. On multicore systems merge sort can run better in parallel so there is no overall best algorithm and in reality modern languages have highly optimised versions of those like introsort or timsort
2026-11-17 10:00:25
11
doik 🚦 :
comeback slop
2026-11-17 02:51:37
6
Obdorm1tioπ :
ahhh almost almost
2026-11-17 09:25:02
5
half-ass working robot :
MERGE SORT LETS GOOO
2026-11-17 14:34:26
1
❦ :
Merge rebuilding ts like a jpeg file
2026-11-17 07:46:35
5
akb_brian :
quicksort is better because you can start processing the processed data immediately.
2026-11-17 20:53:18
1
carl :
count sort
2026-11-17 07:20:44
1
Ain :
я па чистичкам сабираю твой партер
2026-11-17 05:18:12
13
concrete soup :
radix sort is the goat
2026-11-17 01:26:46
86
Max :
quantum bogo sort
2026-11-16 18:47:20
43
Baannaanaaa🍌 :
hey
2026-11-17 06:18:22
0
ItsGabe _ :
comeback slop
2026-11-17 07:05:44
2
🎃🍂 ⋮ 𝄞 arti_93༉ 🧡 :
im gonna gues merge sort?
2026-11-17 17:58:13
0
Skinny bigback :
merge sort is good on large files, quick sort is still pretty quick yet slower the bigger the file is
2026-11-17 06:54:23
1
To see more videos from user @verycoolmango, please go to the Tikwm
homepage.