How Binary Search Makes Computers Much, Much Faster
Featuring binary versus linear search, and non-clustered indexes. Uh, indices. However you want to say it. • MORE BASICS: • The Basics Written with Sean Elliott / seanmelliott • Camera by Tomek • Graphics by Willow Marler https://wmad.co.uk 🟥 MORE FROM TOM: https://www.tomscott.com/ (you can find contact details and social links there too) 📰 WEEKLY NEWSLETTER with good stuff from the rest of the internet: https://www.tomscott.com/newsletter/ ❓ LATERAL, free weekly podcast: https://lateralcast.com/ / lateralcast ➕ TOM SCOTT PLUS: / tomscottplus 👥 THE TECHNICAL DIFFICULTIES: / techdif
▶︎
Why You Can't Name A File CON In Windows
▶︎
Are There Problems That Computers Can't Solve?
▶︎
Binary Search Algorithm - Computerphile
▶︎
Why You Should Turn On Two Factor Authentication
▶︎
Google Maps is unreasonably fast. Let me explain
▶︎
Why Computers Can't Count Sometimes
▶︎
Ham Sandwich Problem - Numberphile
▶︎
Why My Teenage Code Was Terrible: Sorting Algorithms and Big O Notation
▶︎
The Fetch-Execute Cycle: What's Your Computer Actually Doing?
▶︎
How The Imitation Game Got Alan Turing Wrong...
▶︎
Why The Web Is Such A Mess
▶︎
Why Progress Bars Don't Move Smoothly ▓▓▓░░░░░░
▶︎
Floating Point Numbers - Computerphile
▶︎
We've never seen an atom. But we know what they look like.
▶︎
The Insane Genius of a Formula 1 Gearbox
▶︎
The Two Generals’ Problem
▶︎
The Art of the Bodge: How I Made The Emoji Keyboard
▶︎
10 Sorting Algorithms Easily Explained
▶︎
What happens if you sell multipack items separately?
▶︎