Estimated Time

15 minutes

Learning Objectives of this Module

In this module, we will:

• Understand why sorting can be used as a preprocessing step before searching.
• Understand the prerequisite of the Binary Search algorithm.
• Understand why Binary Search requires an ordered array.
• Understand the working of the Binary Search algorithm.
• Analyze how Binary Search reduces the search space at every iteration.
• Understand the time and auxiliary space complexity of iterative Binary Search.
• Practice the algorithm.
• Test your conceptual understanding with a short quiz.