Skip to content
View collinskoech11's full-sized avatar
💻
Analysis Mode
💻
Analysis Mode

Block or report collinskoech11

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Please don't include any personal information such as legal names or email addresses. Maximum 100 characters, markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse

Pinned Loading

  1. 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.