💻
Analysis Mode
Devoted Developer |
Aspire to Inspire |
GDSC-CUEA Lead Alumni | Nathan Digital
-
NathanDigital
- Kenya
-
06:20
(UTC +03:00) - www.koechcollins.com
- @itskenyancoko
Highlights
Block or Report
Block or report collinskoech11
Report abuse
Contact GitHub support about this user’s behavior. Learn more about reporting abuse.
Report abusePinned Loading
-
Data Structures and Algorithms(Notes...
Data Structures and Algorithms(Notes & Guidelines) 1# Binary Search
2### Efficient algorithm for finding an item in a sorted list of items . it works by repeatedly dividing in half the partitionof the list that could contain the item , until you,ve narrowed down the possible locations to just one
3### we basically ignore half of the elements afer just one iteration
4### i) Compare x with the middle element
5### ii) if x matches the middle element, we return the mid index.
Something went wrong, please refresh the page to try again.
If the problem persists, check the GitHub status page or contact support.
If the problem persists, check the GitHub status page or contact support.