B3. Consider an array a[] = { "Abdullah", "Butaina","George", "Inam", "Jim", "kawther", "kavin", "Raba", "Robin", "Roza"}. The nane "George" (target) to be searched using the binary search algorithm given below. Trace the variables low, high, and mid to complete the task. Public int binarySearch(String[] a, String target) { high=a.length-1 low=0; While (low<= high) { int mid=(low+high)/2; int low high mid com-target.compareTo(a[mid]); if (com = 0) return mid; else if (com < 0) high=mid-%3B else low = mid+l: return -13;
B3. Consider an array a[] = { "Abdullah", "Butaina","George", "Inam", "Jim", "kawther", "kavin", "Raba", "Robin", "Roza"}. The nane "George" (target) to be searched using the binary search algorithm given below. Trace the variables low, high, and mid to complete the task. Public int binarySearch(String[] a, String target) { high=a.length-1 low=0; While (low<= high) { int mid=(low+high)/2; int low high mid com-target.compareTo(a[mid]); if (com = 0) return mid; else if (com < 0) high=mid-%3B else low = mid+l: return -13;
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
![B3. Consider an array a[] = { "Abdullah", "Butaina","George", "Inam", "Jim", "kawther",
"kavin", "Raba", "Robin", "Roza"}. The nane "George" (target) to be searched
using the binary search algorithm given below. Trace the variables low, high, and
mid to complete the task.
Public int binarySearch(String[] a, String target) {
high=a.length-1
low=0;
While (low<= high) {
int mid=(low+high)/2;
int
low
high
mid
com-target.compareTo(a[mid]);
if (com = 0)
return mid;
else if (com < 0)
high=mid-%3B
else
low = mid+l:
return -13;](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fe4147ef3-0bc9-4712-a644-c75d92a11467%2F43ee98d1-4e00-42b3-a183-337536be3ebc%2Flx1fmgi_processed.jpeg&w=3840&q=75)
Transcribed Image Text:B3. Consider an array a[] = { "Abdullah", "Butaina","George", "Inam", "Jim", "kawther",
"kavin", "Raba", "Robin", "Roza"}. The nane "George" (target) to be searched
using the binary search algorithm given below. Trace the variables low, high, and
mid to complete the task.
Public int binarySearch(String[] a, String target) {
high=a.length-1
low=0;
While (low<= high) {
int mid=(low+high)/2;
int
low
high
mid
com-target.compareTo(a[mid]);
if (com = 0)
return mid;
else if (com < 0)
high=mid-%3B
else
low = mid+l:
return -13;
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 3 steps
Similar questions
Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education