This repository contains a number of standard problems based on binary search. The code is in Java. Following are the topics covered:
- Simple Binary Search
- Binary Search on Reverse Sorted Array
- Order Agnostic Binary Search
- First Occurrence of an Element in a Sorted Array
- Last Occurrence of an Element in a Sorted Array
- Count of an Element in a Sorted Array
- Number of Times a Sorted Array is Rotated
- Searching an Element in a Rotated Sorted Array
- Searching in a Nearly Sorted Array
- Finding Floor of an Element in a Sorted Array
- Finding Ceiling of an Element in a Sorted Array
- Next Alphabetical Element in a Sorted Array of Alphabets
- Searching in an Infinite Sorted Array
- Position of First 1 in a Binary Sorted Infinite Array
- Minimum Difference Element in a Sorted Array
- Peak Element
- Maximum Element in a Bitonic Array
- Searching in a Bitonic Array
- Searching in Row wise and Column wise sorted Matrix
- Allocate Minimum Number Of Pages
To compile the code, simply run the javac ${FILE_NAME}.java
command. To run the code, use java ${FILE_NAME}
.
javac ${FILE_NAME}.java
java ${FILE_NAME}