Hidden Integer Overflow Bug of Binary Search for 20 years (JAVA)-Part 1 of 2 || Algorithmica
For more details please visit us at : www.algorithmica.co.in
#Algorithmica #ThimmaReddy #SmartCoding_and_InterviewSeries #Binarysearch
This overflow bug was the bug in Java's Arrays.binarySearch(), that was discovered in
2006 after almost 9 years of hiding. The binary-search bug applies equally to all most all divide & prune, divide & conquer algorithms.
The 1st part demonstrates how to reproduce the bug. The 2nd part gives in-depth reasoning for the bug and also the two fixes for the bug with code.
At Algorithmica, we believe that education means training of the mind to think and solve problems with direct experience. The only knowledge that creates value for any professional/engineer/human being is by his experiential knowledge i.e., wisdom.
We have created a series of courses to give transformational experience to the people and our work should speak about us.
Our Mission is to demonstrate Computational thinking and experience to solve practical problems in areas of algorithms, machine learning, deep learning, software design, and architecture.