binary search impl

README.md

@@ -38,6 +38,8 @@ This repo register my evolution in the Cracking The Coding Interview book as I g
 
 [My Binary Tree Implementation](https://github.com/brendonmiranda/CrackingTheCodingInterview/blob/main/src/main/java/cracking/the/code/interview/chapter4/BinaryTree.java)
 
+[My Binary Search Implementation](https://github.com/brendonmiranda/CrackingTheCodingInterview/blob/main/src/main/java/cracking/the/code/interview/chapter4/BinarySearch.java)
+
 # Chapter 5 | Bit Manipulation
 
 [**5.1** Insertion: You are given two 32-bit numbers, N and M, and two bit positions, i and j. Write a method to insert M into N such that M starts at bit j and ends at bit i. You can assume that the bits j through i have enough space to fit all of M. That is, if M=10011, you can assume that there ate at least 5 bits between j and i. You would not, for example, have j=3 and i=2, because M could not fully fit between bit 3 and 2.](https://github.com/brendonmiranda/CrackingTheCodingInterview/blob/main/src/main/java/cracking/the/code/interview/chapter5/Question51.java)