I just need the table filled out
#Searching Exercise By Antonio Rotondo
def ordered_sequential_search(a_list, item):
pos = 0
found = False
stop = False
count = 0
while pos < len(a_list) and not found and not stop:
count += 1
if a_list[pos] == item:
found = True
else:
if a_list[pos] > item:
stop = True
else:
pos = pos+1
return found, count
test_list = [0, 1, 2, 8, 13, 17, 19, 32, 42,]
print(ordered_sequential_search(test_list, 3))
print(ordered_sequential_search(test_list, 13))
def sequential_search(a_list, item):
pos = 0
found = False
count = 0
while pos < len(a_list) and not found:
count += 1
if a_list[pos] == item:
found = True
else:
pos = pos+1
return found, count
test_list = [1, 2, 32, 8, 17, 19, 42, 13, 0]
def binary_search(a_list, item, count):
if len(a_list) == 0:
return False, count
else:
midpoint = len(a_list) // 2
count+=1
if a_list[midpoint] == item:
return True, count
else:
if item < a_list[midpoint]:
return binary_search(a_list[:midpoint], item, count)
else:
return binary_search(a_list[midpoint + 1:], item,count)
test_list = [0, 1, 2, 8, 13, 17, 19, 32, 42,]
print(binary_search(test_list, 3, 0))
print(binary_search(test_list, 13, 0))
print(sequential_search(test_list, 3))
print(sequential_search(test_list, 13))
I just need the table filled out
![**Topic: Comparing Search Algorithms**
**List Definition:**
- `myList = [1, 2, 32, 8, 17, 19, 42, 13, 0]`
**Instructions:**
Ensure to use the sorted list when performing both the Ordered Sequential Search and the Binary Search.
**Table: Number of Elements Checked Using Each Search Method**
| Search Term | Sequential Search | Ordered Sequential Search | Binary Search |
|----------------|-------------------|---------------------------|---------------|
| Search for 3 | | | |
| Search for 13 | | | |
**Assignment:**
Submit your code (as a `.py` file) along with this completed table in a document file.
---
Note: The table should be filled with the number of elements checked for each search algorithm when searching for the specified terms.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fa3f90e95-6ace-4455-9a40-a789a93ab131%2F74cc6676-d095-4603-8c3a-c3adfcaf3033%2Fmkp6wjr_processed.png&w=3840&q=75)
![](/static/compass_v2/shared-icons/check-mark.png)
Step by step
Solved in 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)