LeetCode #35: Search Insert Position | Binary Search

A step-by-step visualization of #LeetCode question 35: Search Insert Position, with an explanation of the #BinarySearch algorithm.

0:00 Intro
0:43 Binary Search Overview
1:36 Why is it O(log n)?
2:27 Code Walkthrough
5:07 If target is not found

#coding #algorithms #programming

[peterpetertorres]

This is so clever. Thank you for explaining it so well.

[SerhijA]

You're so smart. I felt as a fool sitting my third hour on it. Though I did similiar thing.
Thank you very much :)

[jpkeys]

Best explanation and visuals out there. Thank you!

[aryahonraopatil]

two other possibilities for l, m and r.
1) l = m, r = l+1.
2) r = m, l = r-1

[SophieD-ys]

Thank you for your video! Great explanation!