TLDR
Binary Search in JavaScript uses a brute force method to solve search problems. The Big O notation of brute force is usually and unacceptably equal to or greater than bigO(n²) Binary Search will not work for an unsorted list because it uses a sort of educated guess. The standard implementation of binary search is:Start a while loop that will terminate if the target is not found. Reassign the start index or the end index to the guess index. You reassign your guess to the middle of the halved array.via the TL;DR App
no story
Written by Swordfish | JS, React, Redux, Ruby, Rails, SQL, Python
