Skip to content
/ Binary_search Public

In binary search, recursion is used to repeatedly divide a sorted array into halves until the target value is found. The algorithm compares the middle element to the target, then recursively searches either the left or right half depending on the comparison, reducing the search space efficiently.

0 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

vishalku03/Binary_search

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

30 Commits
1ST AND LAST OCCURRENCE .cpp
1ST AND LAST OCCURRENCE .cpp
 
 
ARRANGING COINS .cpp
ARRANGING COINS .cpp
 
 
CAPACITY TO SHIP PACKAGES WITHIN D DAYS.cpp
CAPACITY TO SHIP PACKAGES WITHIN D DAYS.cpp
 
 
CHECK IF N AND DOUBLE EXITS .cpp
CHECK IF N AND DOUBLE EXITS .cpp
 
 
COUNT -VE N0. IN A SORTED MATRIX.cpp
COUNT -VE N0. IN A SORTED MATRIX.cpp
 
 
COUNT COMPLETE TREE NOTES .cpp
COUNT COMPLETE TREE NOTES .cpp
 
 
FIND +ve INTEGER SULUTION OF A GIVEN EQUATION .cpp
FIND +ve INTEGER SULUTION OF A GIVEN EQUATION .cpp
 
 
FIND KTH MISSING NUMBER .cpp
FIND KTH MISSING NUMBER .cpp
 
 
FIND PAIR GIVEN DIFFERENCE.cpp
FIND PAIR GIVEN DIFFERENCE.cpp
 
 
FIND TARGET INDICES AFTER SORTING .cpp
FIND TARGET INDICES AFTER SORTING .cpp
 
 
FIND THE DISTANCE VALUE BETWEEN TWO ARRAYS .cpp
FIND THE DISTANCE VALUE BETWEEN TWO ARRAYS .cpp
 
 
FIND THE ELEMENTS THAT APPEARS ONCE IN SORTED ARRAY.cpp
FIND THE ELEMENTS THAT APPEARS ONCE IN SORTED ARRAY.cpp
 
 
FIND THE PIVOT ELEMENT.cpp
FIND THE PIVOT ELEMENT.cpp
 
 
GUESS NUMBER HIGHER OR LOWER .cpp
GUESS NUMBER HIGHER OR LOWER .cpp
 
 
INTERSECTION OF TWO ARRAYS .cpp
INTERSECTION OF TWO ARRAYS .cpp
 
 
LEETCODE 1608.cpp
LEETCODE 1608.cpp
 
 
LONGEST SUBSEQUENCE WITH LIMITED SUM .cpp
LONGEST SUBSEQUENCE WITH LIMITED SUM .cpp
 
 
MAX. COUNT OF +VE AND -VE INTEGER .cpp
MAX. COUNT OF +VE AND -VE INTEGER .cpp
 
 
MAX. NO. OF INTEGER TO CHOOSE FROM A RANGE 1.cpp
MAX. NO. OF INTEGER TO CHOOSE FROM A RANGE 1.cpp
 
 
MAXIMAISE THE CONFUSION IN THE EXM .cpp
MAXIMAISE THE CONFUSION IN THE EXM .cpp
 
 
MAXIMUM NUMBER OF GROUP ENTERING IN A COMPITION.cpp
MAXIMUM NUMBER OF GROUP ENTERING IN A COMPITION.cpp
 
 
MINIMUM COMMON VALUE .cpp
MINIMUM COMMON VALUE .cpp
 
 
MINIMUM PLATFORMS.cpp
MINIMUM PLATFORMS.cpp
 
 
README.md
README.md
 
 
SMALLEST LETTER GREATER THAN TARGET .cpp
SMALLEST LETTER GREATER THAN TARGET .cpp
 
 
SQUARE ROOT OF A NUMBER .cpp
SQUARE ROOT OF A NUMBER .cpp
 
 
VALID PERFECT SQARE .cpp
VALID PERFECT SQARE .cpp
 
 
building boxes.cpp
building boxes.cpp
 
 
find the smallest divisors given a threshold.cpp
find the smallest divisors given a threshold.cpp
 
 
search suggestions system.cpp
search suggestions system.cpp
 
 

Repository files navigation

DSA---BINARY-SEARCH

Leetcode and GFG

About

In binary search, recursion is used to repeatedly divide a sorted array into halves until the target value is found. The algorithm compares the middle element to the target, then recursively searches either the left or right half depending on the comparison, reducing the search space efficiently.

Topics

cpp leetcode-questions dsa gfg-questions

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages