1. Linear Search Algorithm (a) Consider the elements 8 28 38 2 15 49 20 76 4 79 5 81. Show the location of the number 76 on the list by performing analysis using Linear Search Algorithm. while ( ( i ≤ n ) && ( x != ai ) ) a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 8 28 38 2 15 49 20 76 4 79 5 81 (b) Consider the elements 15 9 78 54 13 19 6 2 1 52 87 91 while ( ( i ≤ n ) && ( x != ai ) ) a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 15 9 78 54 13 19 6 2 1 52 87 91
1. Linear Search Algorithm (a) Consider the elements 8 28 38 2 15 49 20 76 4 79 5 81. Show the location of the number 76 on the list by performing analysis using Linear Search Algorithm. while ( ( i ≤ n ) && ( x != ai ) ) a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 8 28 38 2 15 49 20 76 4 79 5 81 (b) Consider the elements 15 9 78 54 13 19 6 2 1 52 87 91 while ( ( i ≤ n ) && ( x != ai ) ) a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 15 9 78 54 13 19 6 2 1 52 87 91
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
1. Linear Search Algorithm
(a) Consider the elements 8 28 38 2 15 49 20 76 4 79 5 81.
Show the location of the number 76 on the list by performing analysis using Linear Search
Algorithm.
while ( ( i ≤ n )
&& ( x != ai ) )
a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12
8 28 38 2 15 49 20 76 4 79 5 81
(b) Consider the elements 15 9 78 54 13 19 6 2 1 52 87 91
while ( ( i ≤ n )
&& ( x != ai ) )
a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12
15 9 78 54 13 19 6 2 1 52 87 91
Transcribed Image Text:2. Binary Search Algorithm
(c) Consider the elements 15 9 78 54 13 19 6 2 1 52 87 91
Perform the analysis by showing how the location of the number 52 can be found by using binary
search algorithm.
a5 a6
a8
a10 | all al2
i=1;
jen;
while (i < j)
m=[i+j)/2
al
a2
a3
a4
a7
a9
13 19
52 87
15
78 54
6 2
91
j=
1.
9,
Transcribed Image Text:1. Linear Search Algorithm
(a) Consider the elements 8 28 38 2 15 49 20 76 4 79 5 81.
Show the location of the number 76 on the list by performing analysis using Linear Search
Algorithm.
while ( ( isn)
al
a4
a5
a7
a10 | a11 | a12
a2
a3
аб
a8
a9
&& ( x != ai ) )
8
28
38
2
15
20
76
79
81
49
4
(b) Consider the elements 15 9 78 54 13 19 6 2 1 52 87 91
a6
while ( (isn) al
&& ( x != ai ) )
a2
15
a3
a5
a10 | al1 al12
a4
a7
a8
a9
78
54
13
19
6
2
1
52
87
91
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 2 steps
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