Create a function: • that takes a 2D list and an integer v, and returns the number of times the value v is in the list of lists. Add the NPas variable to count how many times the loops are executed and display a message. • The main program must give a 2D list (no need to generate it, just create it manually), call the function, and display the result. • If the list is already sorted in ascending order, can you find an efficient algorithm to find a value v, without having to traverse the whole list? • Add a variable to count the number of steps taken by your function. Example: >>> binary_research ([1, 2, 3, 4, 4, 5, 7, 9, 10, 13], 10) Number of steps 3 True >>> binary_research ([1, 2, 3, 4, 4, 5, 7, 9, 10, 13], 6) Number of steps 4 False
Create a function: • that takes a 2D list and an integer v, and returns the number of times the value v is in the list of lists. Add the NPas variable to count how many times the loops are executed and display a message. • The main program must give a 2D list (no need to generate it, just create it manually), call the function, and display the result. • If the list is already sorted in ascending order, can you find an efficient algorithm to find a value v, without having to traverse the whole list? • Add a variable to count the number of steps taken by your function. Example: >>> binary_research ([1, 2, 3, 4, 4, 5, 7, 9, 10, 13], 10) Number of steps 3 True >>> binary_research ([1, 2, 3, 4, 4, 5, 7, 9, 10, 13], 6) Number of steps 4 False
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Please write your own code and use some commentary thank you
![Create a function:
that takes a 2D list and an integer v, and returns the number of times the value v is in the list of lists.
Add the NPas variable to count how many times the loops are executed and display a message.
• The main program must give a 2D list (no need to generate it, just create it manually), call the function,
and display the result.
• If the list is already sorted in ascending order, can you find an efficient algorithm to find a value v,
without having to traverse the whole list?
• Add a variable to count the number of steps taken by your function.
Example:
>>> binary_research ([1, 2, 3, 4, 4, 5, 7, 9, 10,
13], 10)
Number of steps 3
True
>>> binary_research ([1, 2, 3, 4, 4, 5, 7, 9, 10,
13], 6)
Number of steps 4
False](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F32c13ba7-237d-4629-8f55-05e99d86aab8%2F4647252d-f408-4d10-8cc5-e820e20c7655%2Fj51e6nc_processed.png&w=3840&q=75)
Transcribed Image Text:Create a function:
that takes a 2D list and an integer v, and returns the number of times the value v is in the list of lists.
Add the NPas variable to count how many times the loops are executed and display a message.
• The main program must give a 2D list (no need to generate it, just create it manually), call the function,
and display the result.
• If the list is already sorted in ascending order, can you find an efficient algorithm to find a value v,
without having to traverse the whole list?
• Add a variable to count the number of steps taken by your function.
Example:
>>> binary_research ([1, 2, 3, 4, 4, 5, 7, 9, 10,
13], 10)
Number of steps 3
True
>>> binary_research ([1, 2, 3, 4, 4, 5, 7, 9, 10,
13], 6)
Number of steps 4
False
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 1 images

Recommended textbooks for you

Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON

Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science

Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning

Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON

Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science

Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning

Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning

Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education

Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY