Search in Rotated Sorted Array - LeetCode 33 - JavaScript

Step by step walk through of the solution to the popular Microsoft coding interview question, Search in Rotated Sorted Array.

LeetCode 33

JavaScript

0:00 Intro
1:04 Explanation
4:10 Code

#softwareengineering #javascript #leetcode

[Ethan-Johnson]

theres an edge case where the implementation of mid does not work

if you use

let mid = Math.floor((left + right) / 2);

to calculate mid. it will work instead!

[fishmisch]

I dont understand the different ways to calculate mid. Why does one cause stack overflow but in other binary search instances we use it without worry?