Binary Search Practice Problems Online

Consider the incomplete python implementation of the binary search algorithm:

def BS( A , lo , hi, target ):
    if hi < lo:
        return -1
    mid = (lo + hi)/2
    if A[mid] == target:
        return mid
    elif A[mid] > target:
        return BS(A, MISSING_VARIABLE1 , MISSING_VARIABLE2, target ) #!
    else:
        return BS(A, MISSING_VARIABLE3, MISSING_VARIABLE4,target)    #!

By which variable names should MISSING_VARIABLE1,MISSING_VARIABLE2,MISSING_VARIABLE3,MISSING_VARIABLE4 be replaced respectively?

Suppose we want to find the root of the function \(f(x) = k\), where \(k\) is a positive real number. For which \(f\) is a binary search applicable?

Which of the following is false about the binary search algorithm?

Concept Quizzes

Challenge Quizzes

Binary Search

Excel in math and science

Master concepts by solving fun, challenging problems.

It's hard to learn from lectures and videos

Learn more effectively through short, interactive explorations.

Used and loved by over 5 million people

Learn from a vibrant community of students and enthusiasts, including olympiad champions, researchers, and professionals.

Sorting Algorithms