拡張機能をインストールして、あらゆる動画内を即座に検索しましょう

Binary search finds 1 in a million in 20 steps. Here's how.
追加:

616 回視聴5高評価39SysSketch元のリリース: 2026-05-16

Binary search is an efficient algorithm that finds an item in a sorted list by repeatedly dividing the search interval in half, starting from the middle; for a list of 1 million entries, it requires at most 20 steps, and for 1 billion entries, only 30 steps, but it requires the list to be sorted to work effectively.

関連おすすめ

Agentforce NOW AMA: Build with React and Salesforce Multi-Framework

SalesforceDevs

490 views2026-05-28

How agent o11y differs from traditional o11y — Phil Hetzel, Braintrust

aiDotEngineer

450 views2026-05-28

WEB TECHNOLOGIES UNIT-2 | Degree 4th sem BCOM Computers web technologies unit-2 full explanation💯✅

LearnwithSahera

1K views2026-05-29

More tests are always better? How to use AI to identify tests that bring little value

Alliance4Qualification

335 views2026-05-29

Search Algorithms Explained in 60 Seconds! 🤖💨

samarthtuliofficial

218 views2026-06-01

People of Game of Thrones using JavaScript DOM

AltCampus

296 views2026-05-30

Introduction to Problem Solving Part - 1 | Lecture 1 | Intermediate DSA

ascensionix

107 views2026-05-29

So What's Odin Lang Even Good For

TechOverTea

131 views2026-06-01

トレンド

The Casino Had Us Guessing All Day

VegasMatt

157K views2026-06-03

The Dancing Plague...

HoodieGuyStories

1730K views2026-05-30

The Fastest Way To Board A Plane 😮

zackdfilms

6504K views2026-05-29

DOOM Runs On Everything...except Neo Geo

ModernVintageGamer

143K views2026-06-01