The Binary Search Algorithm (+ Python Code Solution)

FAANG Coding Interviews / Data Structures and Algorithms / Leetcode

[GregHogg]

Master Data Structures & Algorithms For FREE at AlgoMap.io!

[big-anvil]

In most other languages, its better to do "left + (right - left) // 2", which is equal to "(right + left) // 2", except it takes away the chance of integer overflow. In Python it doesn't matter since numbers can theoretically be as large as needed.

[greensalad_]

Remember that the list MUST be sorted, otherwise it won't work

[mohammedadel]

This can also be done recursively, but then the space complexity increases.

[pangzlab]

Nice video. Forgot one critical thing, it should be sorted first to be able to perform this operation.

[AlexYSun]

Yeah but you’d have to make sure it’s a sorted array first right? So you’d do a sorting algorithm?

[muizHD]

Why is M under -1 when -1 + 0 // 2 = -0.5 always rounds down to 0, M should be = to 0 ?

[observer]

👍🏼 what's the step over this in terms of complexity?

[gomitos]

the problem is when u dont have a target

[putuadibrata]

please make another one, but the list is not sorted. Thank you

[alexkonrad]

Useless cuz you could have random numbers