Question: Consider linear search again (see Exercise 2.1-3). How many elements of the input sequence need to be checked on the average, assuming that the element

Consider linear search again (see Exercise 2.1-3). How many elements of the input sequence need to be checked on the average, assuming that the element being searched for is equally likely to be any element in the array? How about in the worst case? What are the average-case and worst-case running times of linear search in Θ-notation? Justify your answers.

Exercise 2.1-3

Consider the searching problem:

Input: A sequence of n numbers A = 〈a_1, a₂,....,a_n〉 and a value ν.

Output: An index i such that ν = A[i] or the special value NIL if ν does not appear in A.

Write pseudocode for linear search, which scans through the sequence, looking for ν. Using a loop invariant, prove that your algorithm is correct. Make sure that your loop invariant fulfills the three necessary properties.

Step by Step Solution

★★★★★

3.34 Rating (154 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock

According to the problem statement there are N elements in the array ie a1a2an Search Element v ... View full answer

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Introduction to Algorithms Questions!

Consider sorting n numbers stored in array A by first finding the smallest element of A and exchanging it with the element in A[1]. Then find the second smallest element of A, and exchange it with A...

Referring back to the searching problem (see Exercise 2.1-3), observe that if the sequence A is sorted, we can check the midpoint of the sequence against v and eliminate half of the sequence from...

This problem examines three algorithms for searching for a value x in an unsorted array A consisting of n elements. Consider the following randomized strategy: pick a random index i into A. If A[i] =...

Exercise 2.2-3: Consider linear search again (see Exercise 2.1-3). How many elements of the input sequence need to be checked on the average, assuming that the element being searched for is equally...

Exercises 2 . 2 - 1 Express the function n 3 1 0 0 0 - 1 0 0 n 2 - 1 0 0 n + 3 in terms of - notation. 2 . 2 - 2 Consider sorting n numbers stored in array A by first finding the smallest element of...

5. P29: 2.2-2, 2.2-3 2.2-2 Consider sorting n numbers stored in array A by first finding the smallest element of A and exchanging it with the element in A[1]. Then find the second smallest element of...

1. Consider sorting n numbers stored in array A by first finding the smallest element of A and exchanging it with the element in A1. Then find the second smallest element of A, and exchange it with...

and this is the exercise 2.1-3 that was mentioned in the question above 2.2-3 Consider linear search again (see Exercise 2.1-3). How many elements of the in- put sequence need to be checked on the...

The above retailer wants to understand the relationship between which of two products will be purchased by a subject, based on their different designs. Now, which types of model can be considered to...

An educator has obtained class average scores on a standardized test for classes from each grade from first through seventh at each of four schools in a city. These are shown in the following table....

Item 4 1 2 . 2 2 points Time Remaining 1 hour 2 1 minutes 4 1 seconds 0 1 : 2 1 : 4 1 Item 4 1 Time Remaining 1 hour 2 1 minutes 4 1 seconds 0 1 : 2 1 : 4 1 If the value of a Treasury bond was higher...

How can we summarize the production possibilities curve?

Describe a modification to the binary search-tree data structure that would support the following two index-based operations for a sorted map in O(h) time, where h is the height of the tree....

Draw a splay tree, T 1 , together with the sequence of updates that produced it, and a red-black tree, T 2 , on the same set of ten entries, such that a preorder traversal of T 1 would be the same as...

Let T be a red-black tree storing n entries, and let k be the key of an entry in T. Show how to construct from T, in O(logn) time, two red-black trees T and T, such that T contains all the keys of T...

Please show work The cost of preferred stock Firms Chat carry preferred stock In their capital mix want to not only distribute dividends Co common stockholders but also maintain credibility in the...

In the hit song "How 'Ya Gonna Keep 'Em Down on the Farm" we listened to this week, Who is hard to keep down on the farm? O The livestock who keep escaping due to poor fencing. O The livestock who...

Quantitative Problem: Bellinger Industries is considering two projects for inclusion in its capital budget, and you have been asked to do the analysis. Both projects' after-tax cash flows are shown...