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))

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

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))

 

 

 

# ****Your Work****
### @solution
def binary_search(values, to_find, start_index, end_index):
...
#
### @check (binary_search performance) @grade (1)
max_elements = 100000
for length in range (1, max_elements, 10000):
values= list (range(1, (2 length) + 1, 2))
num_comparisons, found
num_comparison_string
=
binary_search (values, length + 1, 0, len(values) - 1)
format (num_comparisons, '03d')
(num_comparisons // 10))
print (num_comparison_string,
Transcribed Image Text:# ****Your Work**** ### @solution def binary_search(values, to_find, start_index, end_index): ... # ### @check (binary_search performance) @grade (1) max_elements = 100000 for length in range (1, max_elements, 10000): values= list (range(1, (2 length) + 1, 2)) num_comparisons, found num_comparison_string = binary_search (values, length + 1, 0, len(values) - 1) format (num_comparisons, '03d') (num_comparisons // 10)) print (num_comparison_string,
Expert Solution
steps

Step by step

Solved in 4 steps with 1 images

Blurred answer
Knowledge Booster
Arrays
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education