The precondition to using Binary Search is that the array should be sorted. Binary Search is similar to how we search for a word in the dictionary. In Binary search, we divide the array successively into 2 halves and search for the element either in the first half or in the second half.
This lesson will explain us Binary Search technique of searching in arrays. We will first understand Binary Search through a real-world example and then go over the Binary Search Java program in BlueJ to develop a thorough understanding of Binary Search.
👉 Subscribe to KnowledgeBoat - https://bit.ly/subscribe-kboat
👉 Watch on KnowledgeBoat - https://bit.ly/kboat-binary-search
👉 Visit KnowledgeBoat - https://bit.ly/visit-kboat-binary-search
