Considering the search problem, we have a list of ?n integers ?=⟨?1,?2,⋯??⟩A=⟨v1,v2,⋯vn⟩. We want to design an algorithm to check whether an item ?v exists or not such that it should return either the index, ?i, if it was found or −1−1 otherwise, when not found. a) Algorithm Implementation In [ ]: # write your implementation here b) Growth Curve Empirically, using time measurements, test your algorithm and plot a graph that shows its growth rate when variating the size. In [ ]: # feel free to import what you want In [ ]: # recording the time for various calls In [ ]: # the code to plot the curve c) Theoretical Analysis Derive the complexity of the worst-case time, and show your reasoning [Your Derivation] d) Correctness Proof To submit your proof here, you have multiple options as follows: Write your proof here in the notebook using LaTeX [Preferred] Write your proof in any other application, any word processing application, and take a screenshot of your proof; then, put it here as an image Write your proof by hand, and take a photo of your solution and put it here as an image [least preferred] Make sure your write is clear enough; we would not return to ask for a clarification.

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

See similar textbooks

Problem Statement

Considering the search problem, we have a list of ?n integers ?=⟨?1,?2,⋯??⟩A=⟨v1,v2,⋯vn⟩. We want to design an algorithm to check whether an item ?v exists or not such that it should return either the index, ?i, if it was found or −1−1 otherwise, when not found.

a) Algorithm Implementation

In [ ]:

# write your implementation here

b) Growth Curve

Empirically, using time measurements, test your algorithm and plot a graph that shows its growth rate when variating the size.

In [ ]:

# feel free to import what you want

In [ ]:

# recording the time for various calls

In [ ]:

# the code to plot the curve

c) Theoretical Analysis

Derive the complexity of the worst-case time, and show your reasoning

[Your Derivation]

d) Correctness Proof

To submit your proof here, you have multiple options as follows:

Write your proof here in the notebook using LaTeX [Preferred]
Write your proof in any other application, any word processing application, and take a screenshot of your proof; then, put it here as an image
Write your proof by hand, and take a photo of your solution and put it here as an image [least preferred]
Make sure your write is clear enough; we would not return to ask for a clarification.

[Your Proof]

Expert Solution