The curious case of Binary Search — The famous bug that remained undetected for 20 years
you don't know what Binary Search is: It is a search algorithm which uses Divide & Conquer paradigm to search for a target element in sorted array with O(log n) time complexity, where 'n' is the size of array.
Read full article from The curious case of Binary Search — The famous bug that remained undetected for 20 years
No comments:
Post a Comment