Statement 1 :- Search a sorted array by repeatedly dividing the search interval in half. Begin with an interval covering the whole array. If the value of the search key is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise, narrow it to the upper half. Repeatedly check until the value is found or the interval is empty.
forked from mitalitak/codedocs
-
Notifications
You must be signed in to change notification settings - Fork 0
Tanu1tt/codedocs
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
Beginners friendly topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published