PLEASE DO THIS IN PYTHON Part 4 - Performance of binary_search Modify your binary_search function to count the number of comparisons (==, <, <=, >, or >=). The function will now return both the number of comparisons made and the True or False result. The code below calls your function, and creates a simple ASCII bar chart of the number of comparisons (divided by 10, to account for small differences). Test Code max_elements = 100000 for length in range(1, max_elements, 10000): values = list(range(1, (2 * length) + 1, 2)) num_comparisons, found = binary_search(values, length + 1, 0, len(values) - 1) num_comparison_string = format(num_comparisons, '03d') print(num_comparison_string, '*' * (num_comparisons // 10))
PLEASE DO THIS IN PYTHON
Part 4 - Performance of binary_search
Modify your binary_search function to count the number of comparisons (==, <, <=, >, or >=). The function will now return both the number of comparisons made and the True or False result.
The code below calls your function, and creates a simple ASCII bar chart of the number of comparisons (divided by 10, to account for small differences).
Test Code
max_elements = 100000 for length in range(1, max_elements, 10000): values = list(range(1, (2 * length) + 1, 2)) num_comparisons, found = binary_search(values, length + 1, 0, len(values) - 1) num_comparison_string = format(num_comparisons, '03d') print(num_comparison_string, '*' * (num_comparisons // 10))
Performance of binary search
Below code modify binary_search function to count the number of comparison.
Step by step
Solved in 4 steps with 1 images
