Binary Search in Java
About
Normal search algorithms, also called as linear searches, sequentially check every element of the list until it finds the target element. The larger the list, the longer the average search time. Hence, the time complexity of a linear search algorithm is O(n). This average time complexity can be reduced if the search algorithm follows a divide and conquer strategy. Binary search algorithm is one such efficient algorithm underlying almost all search features you see in apps and websites. In this module, let us understand what a binary search algorithm is and how we can implement one in Java.
Content
| Lesson | Est. Delivery Time | Skills |
|---|---|---|
| Setup | 10 min | Set up the development environment. |
| Binary Search | 30 min | Describe a binary search algorithm. |
| Binary Search Implementation | 20 min | Implement a binary search algorithm using Java code. |
| Total content | 1 hr |