Algorithm 4.2.1: Binary Search #2 // version #2.0 Begin p - 1; q - n; While (p < q) Do j- [(p+q)/2]; If (A[j]< T) Then p+j+1; Else q +j; End; |/ the if // the while End; // Now, p = q If (A[p]= T) Then Output ("T is A[", p, "]") ; Else Output("T is not in A"); // the if End; End. Walkthrough with n = 12 and A = (3, 5, 8, 8, 9, 16, 29, 41, 50, 63, 64, 67) // A[1] = 3, A[2] = 5, A[3] = 8, A[4] = 8, // A[7] = 29, A[8] = 41, A[9] = 50, A[10] = 63, A[11] = 64, & A[12] = 67 A[5] = 9, A[6] = 16, %3D If T = 9, then (using t for True and f for False) // and T for target p j p
Algorithm 4.2.1: Binary Search #2 // version #2.0 Begin p - 1; q - n; While (p < q) Do j- [(p+q)/2]; If (A[j]< T) Then p+j+1; Else q +j; End; |/ the if // the while End; // Now, p = q If (A[p]= T) Then Output ("T is A[", p, "]") ; Else Output("T is not in A"); // the if End; End. Walkthrough with n = 12 and A = (3, 5, 8, 8, 9, 16, 29, 41, 50, 63, 64, 67) // A[1] = 3, A[2] = 5, A[3] = 8, A[4] = 8, // A[7] = 29, A[8] = 41, A[9] = 50, A[10] = 63, A[11] = 64, & A[12] = 67 A[5] = 9, A[6] = 16, %3D If T = 9, then (using t for True and f for False) // and T for target p j p
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
100%
![Algorithm 4.2.1: Binary Search #2
// version #2.0
Begin
p + 1;
q+n;
While (p < q) Do
j- [(p+q)/2];
If (A[j]<T) Then
p +j+1;
Else
q + j;
// the if
// the while
End;
End;
// Now, p = q
If (A[p]= T) Then
Output ("T is A[", p, "]") ;
Else
Output ("T is not in A") ;
End;
// the if
End.
Walkthrough with n = 12 and A = (3, 5, 8, 8, 9, 16, 29, 41, 50, 63, 64, 67)
// A[1] = 3, A[2] = 5,
A[3] = 8, A[4] = 8,
I А7] 3D 29, A8] — 41, А[9] — 50, А[10] — 63, A[11] — 64,
A[6] = 16,
& A[12] = 67
A[5] = 9,
%3D
If T = 9, then (using t for True and f for False)
// and T for target
р
p<a
A[j]
A[j] < T
A[p] = T
output
1
12
16
f
1
t
4
5
f
4
4
5
t
8
t
f
T is A[5]
5
9.
6.
3.
LO](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F0262c52b-6ed5-4d62-a9e6-892d2b0b045b%2F5f72750f-885f-448e-b95c-44816ebf17a5%2Fhwxh78o_processed.png&w=3840&q=75)
Transcribed Image Text:Algorithm 4.2.1: Binary Search #2
// version #2.0
Begin
p + 1;
q+n;
While (p < q) Do
j- [(p+q)/2];
If (A[j]<T) Then
p +j+1;
Else
q + j;
// the if
// the while
End;
End;
// Now, p = q
If (A[p]= T) Then
Output ("T is A[", p, "]") ;
Else
Output ("T is not in A") ;
End;
// the if
End.
Walkthrough with n = 12 and A = (3, 5, 8, 8, 9, 16, 29, 41, 50, 63, 64, 67)
// A[1] = 3, A[2] = 5,
A[3] = 8, A[4] = 8,
I А7] 3D 29, A8] — 41, А[9] — 50, А[10] — 63, A[11] — 64,
A[6] = 16,
& A[12] = 67
A[5] = 9,
%3D
If T = 9, then (using t for True and f for False)
// and T for target
р
p<a
A[j]
A[j] < T
A[p] = T
output
1
12
16
f
1
t
4
5
f
4
4
5
t
8
t
f
T is A[5]
5
9.
6.
3.
LO
![If T = 64, then
%3D
p<q
A[j]
A[j] < T
A[p] = T
output
12
16
t
7
9
12
t
50
t
10
11
12
t
64
10
10
11
t
63
t
11
11
t
T is A[11]
If T = 23.4, then
// T and the entries in A might be real numbers.
p j
p< a
A[j]
A[j] < T
A[p] = T
output
1
6
12
t
16
t
7
9
12
t
50
7
8
9
t
41
7
7
8
t
29
7
7
f
T is not in A
/| T lies between A6 and A7.
If T =
- 99, then
p< a
A[j]
A[j] < T
A[p] = T
output
1
12
16
t
7
12
t
50
t
10
11
12
t
64
t
12
12
f
T is not in A
// T lies beyond A,.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F0262c52b-6ed5-4d62-a9e6-892d2b0b045b%2F5f72750f-885f-448e-b95c-44816ebf17a5%2F5psqi3_processed.png&w=3840&q=75)
Transcribed Image Text:If T = 64, then
%3D
p<q
A[j]
A[j] < T
A[p] = T
output
12
16
t
7
9
12
t
50
t
10
11
12
t
64
10
10
11
t
63
t
11
11
t
T is A[11]
If T = 23.4, then
// T and the entries in A might be real numbers.
p j
p< a
A[j]
A[j] < T
A[p] = T
output
1
6
12
t
16
t
7
9
12
t
50
7
8
9
t
41
7
7
8
t
29
7
7
f
T is not in A
/| T lies between A6 and A7.
If T =
- 99, then
p< a
A[j]
A[j] < T
A[p] = T
output
1
12
16
t
7
12
t
50
t
10
11
12
t
64
t
12
12
f
T is not in A
// T lies beyond A,.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Recommended textbooks for youDatabase System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSONDatabase System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag…Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education