Why Sorted Code Can Run Faster #shorts

Ajouté : 2026-05-16

[00:00:00]This loop should not care about the order. [music] It adds numbers only when they are above 127.

[00:00:06]But in the famous test, random data took 11 seconds. Sorted data [music] took 2 seconds. Same numbers, same condition.

[00:00:13]So what changed? Think [music] of the CPU like a train switch operator. Every if statement is a fork. Go [music] left or go right. Modern CPUs hate waiting, so they guess the next path before the answer is known. If the data is sorted, the answers come in streaks. [music] No, no, no. Then yes, yes, yes, yes. That pattern is easy. [music] The CPU guesses right and keeps its pipeline moving.

[00:00:37]Random data is different. Yes, no, yes, yes, no. Now the CPU [music] guesses wrong about half the time. When that happens, it throws away work it already started, backs up, [music] and runs the other path. The wild part is, sorting did not make the loop smarter. It made the future easier to guess.