How to Search 1,000,000 Items in 20 Steps (Binary Search)
Автор: DistraDev
Загружено: 2026-01-12
Просмотров: 18
Описание:
Binary Search is a fundamental algorithm for searching. It can halves the number of items in each operation. For example, this allows the algorithm to search 1,000,000 items in at most 20 steps -- O(log n).
Timestamps:
0:00 - How might you guess a number?
0:24 - How might you guess a number out of 100 numbers?
0:40 - Binary Search Basics
1:15 - Binary Search in Python
2:28 - Binary Search Example with Pointers
2:46 - Time Complexity
3:10 - Linear Search vs Binary Search Comparison
3:19 - Big Oh
#binarysearch #algorithms #datastructures #codinginterview #programmingtutorial #bigo #python #dsa
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
