×
Log in to StudySoup
Get Full Access to Data Structures & Abstractions - 3 Edition - Chapter 18 - Problem 13
Join StudySoup for FREE
Get Full Access to Data Structures & Abstractions - 3 Edition - Chapter 18 - Problem 13

Already have an account? Login here
×
Reset your password

In Segment 18.7, we said that a sequential search of an array will examine on average

Data Structures & Abstractions | 3rd Edition | ISBN: 9780136100911 | Authors: Frank M. Carrano ISBN: 9780136100911 379

Solution for problem 13 Chapter 18

Data Structures & Abstractions | 3rd Edition

  • Textbook Solutions
  • 2901 Step-by-step solutions solved by professors and subject experts
  • Get 24/7 help from StudySoup virtual teaching assistants
Data Structures & Abstractions | 3rd Edition | ISBN: 9780136100911 | Authors: Frank M. Carrano

Data Structures & Abstractions | 3rd Edition

4 5 1 351 Reviews
20
0
Problem 13

In Segment 18.7, we said that a sequential search of an array will examine on average about half of the n entries. Lets look a little more carefully at this computation. A sequential search is either successful or not. Let be the probability that we will find the desired value in the array and 1 - be the probability that we will not. We further assume that the value, if found, is equally likely to be in each of the locations of the array. We need to consider each possibility. For each case, we count the comparisons and determine its probability of occurrence. To find the average number of comparisons made by the search, we first multiply each probability by the number of comparisons in each case. The following table summarizes these results: Probability Number of Comparisons Product Found at index 0 Found at index 1 Found at index 2 ... Found at index n - 2 Found at index n - 1 Not found / n / n / n ... / n / n 1 1 2 3 ... n 1 n n / n 2 / n 3 / n ... (n 1) / n (1 ) n a. Compute the average number of comparisons by adding all the products in the last column of the table.b. What is the average number of comparisons if the search is guaranteed to be successful ( = 1)?c. What is the average number of comparisons if the search is guaranteed to be unsuccessful ( = 0)?d. What is the average number of comparisons if the search is successful half of the time ( = 0.5)?

Step-by-Step Solution:
Step 1 of 3

Weekly ¥8 Notes Mondayarc21,2016 JoiPMF Marginal range JointMF Giv:n SkyofX&Y E@# )={0,014,014,1B circ,its onlyvalioutcomes Outcomarindependent 11£ , jointF ×=#aoa,tP(N=otlstrajeotiRnR -0.01- " Pxtx,y)=PK=X,y=y) ,=co .mil/RA.s8jEY*pE#T*stTAtRd-on ={ m:} 'D Y=ex)T

Step 2 of 3

Chapter 18, Problem 13 is Solved
Step 3 of 3

Textbook: Data Structures & Abstractions
Edition: 3
Author: Frank M. Carrano
ISBN: 9780136100911

Other solutions

People also purchased

Related chapters

Unlock Textbook Solution

Enter your email below to unlock your verified solution to:

In Segment 18.7, we said that a sequential search of an array will examine on average