Evaluate two sorting or two search algorithms : Bisection/Binary search - Iterative implementation

The video tutorial covers the iterative implementation of a search function, starting with an initial setup and correcting the function to find numbers in a list. It addresses different cases where the number is greater or less than the midpoint and finalizes the implementation with test cases. The video concludes with testing the implementation and hints at a future recursive approach.

What is the purpose of the initial setup in the iterative implementation of binary search?

• To define the function and create a starter list

• To find the midpoint of the list

• To handle cases where the target is greater than the midpoint

• To finalize the implementation with a while loop

How do you find the midpoint of a list in binary search?

• By adding the start and end indices and dividing by two

• By subtracting the start index from the end index

• By multiplying the start and end indices

• By using the length of the list

What should you do if the target number is greater than the midpoint?

• Keep the start and end indices the same

• Restart the search from the beginning

• Adjust the end index to mid minus one

• Adjust the start index to mid plus one

When the target number is less than the midpoint, what adjustment is made?

• Keep the indices unchanged

• Double the size of the list

• Set the start index to mid plus one

• Set the end index to mid minus one

What is the purpose of the while loop in the binary search implementation?

• To create a list of various sizes

• To continuously adjust the search range until the target is found or the list is exhausted

• To find the midpoint of the list

• To handle cases where the target is greater than the midpoint

Why is it important to include the condition 'start <= stop' in the while loop?

• To ensure the loop runs until the list is exhausted

• To find the midpoint of the list

• To handle cases where the target is less than the midpoint

• To create a list of various sizes

What happens if the target number is not found in the list?

• The function returns the midpoint value

• The function creates a new list

• The function returns 'not found in list'

• The function restarts the search

How can you test the binary search function with different list sizes?

• By adjusting the midpoint calculation

• By changing the target number

• By manually entering different lists

• By using a function to create lists of various lengths

What is the significance of integer division in finding the midpoint?

• It is not significant

• It speeds up the calculation

• It allows for decimal values

• It ensures the midpoint is an integer index

What is the next step after completing the iterative implementation?

• To finalize the current implementation

• To move on to a recursive implementation

• To test the function with more numbers

• To create a new list