Consider the following implementation of binarySearch: public static bool binarySearch(int[] a, int item) { int first = 0; int last = a.length - 1; while( first <= last) { int mid = (first + last)/2; if(a[mid] == item) return true; else if (a[mid] < item) first = mid + 1; last = mid - 1; else } return false; } how many times is the line of code int mid = (first + last)/2; executed when it is called with a = {2, 3, 5, 7, 11, 13,17, 19, 23, 29, 31, 37} and item = 2?

Consider the following implementation of binarySearch: public static bool binarySearch(int[] a, int item) { int first = 0; int last = a.length - 1; while( first <= last) { int mid = (first + last)/2; if(a[mid] == item) return true; else if (a[mid] < item) first = mid + 1; last = mid - 1; else } return false; } how many times is the line of code int mid = (first + last)/2; executed when it is called with a = {2, 3, 5, 7, 11, 13,17, 19, 23, 29, 31, 37} and item = 2?

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

See similar textbooks

Related questions

Q: Write a method swapArrayEnds() that swaps the first and last elements of its array parameter. Ex:…

A: Java Programming is the object oriented programming languages. It is used to create the web…

Q: Fix the Java program: Make sure the program have the "Main" function. Code: class…

A: In the given code, the third line "publicstaticvoid Main(String[] args)" have the errors. The…

Q: de: int paths(int i, int j) { static int p[5][5] = {0}; if (i == 0 || j == 0) return 1;…

A: In C++, finish the Robot Paths code. Here is the starter code: int paths(int i, int j) { static…

Q: ass Lc void ru nt[] valu

A: public class LargestValue extends ConsoleProgram{public void run(){int [ ] values = {32, 56, 79, 2,…

Q: n class, we developed pseudocode for a DFA evaluator: string alpha = "a b c"; int state_cnt = 4;…

A: In this question we have to implement the C++ program to read the DFA from a file and verify if…

Q: package sorting; import java.util.Arrays; import java.util.Random; import sorting.Heap;…

A: This program is an implementation of various comparison-based sorting algorithms such as insertion…

Q: Consider the following method. // precondition: arr contains no duplicates; // the…

A: The calls will be made until the base condition is reached.

Q: Write a java class named First_Last_Recursive_Merge_Sort that implements the recursive algorithm for…

A: Step 1: Declare the class with the main() methold. Step 2: Instantiate an array of strings. Step 3:…

Q: Java: Write a program that prompts the user to enter a string and display the maximum consecutive…

A: Here is your solution -

Q: Problem 2: Write the algorithm in pseudocode for a method that accepts three parameters: an integer…

A: Pseucode function countMultiples(array, count, factor) set multipleCount = 0 for i from 0 to…

Q: import java.io.*; import java.util.stream.*; public class Solution { static class ListCell {…

A: Merge Sort is a Divide and Conquer algorithm. It divides the input array into two halves, calls…

Q: Explain Every Step of Below Code: public static void main(String args[]) { int count = 0;…

A: There is a JAVA code given and we have to explain the code.Here's a step-by-step explanation of the…

Q: What is the value of sum? int w = 5; int sum = 0; for (int r = 1; r <= w; r++) for (int s = r; s <=…

A: int w = 5;int sum = 0;for (int r = 1; r <= w; r++)for (int s = r; s <= w; s++)sum = sum + s;…

Q: import java.util.HashSet; import java.util.Set; // Define a class named LinearSearchSet public…

A: 1. Start 2. Create HashSet of integer called numbers and declare target variable of integer type. 3.…

Q: Complete the TODO by finishing the accuracy() function. 1. Compute the total number of correct…

A: Complete the TODO by finishing the accuracy() function.1. Compute the total number of correct…

Q: Compute the average kids per family. Note that the integers should be type cast to doubles.

A: Please find the answer below :

Q: Assign is Teenager with true if kidAge is 13 to 19 inclusive. Otherwise, assign is Teenager with…

A: logic:- It is simple case of if and else. if(kidAge>=13 && kidAge<=19)…

Question

Consider the following implementation of binarySearch:
public static bool binarySearch(int[] a, int item) {
int first = 0;
int last = a.length - 1;
while( first <= last) {
int mid = (first + last)/2;
if(a[mid]
item) return true;
else if (a[mid] < item) first = mid + 1;
else
last = mid - 1;
}
return false;
==
}
how many times is the line of code int mid = (first + last)/2; executed when it is
called with a = {2, 3, 5, 7, 11, 13,17, 19, 23, 29, 31, 37} and item = 2?

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!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

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

What will the final values of count1 and count2 be in terms of n? assume that n is a power of 2 of the form 2^r.
Question 3 Consider the following code: public static boolean[] [] whichOdd (int[] [] arr) { boolean[] [] result = new boolean [arr.length] [arr [0].length]; for (int i = 0; i < arr.length; i++) { for (int j = 0; j < arr[i].length; j++) { result[i][j] = arr[i][j] % 2 != 0; } [ ] Suppose you have written this solution to a problem that asks you to write a method that accepts a 2D array of integers (guaranteed to be rectangular) and returns a 2D array of boolean s where each element is true if its corresponding element in the parameter 2D array is odd, and false otherwise. You've already tried it with the problem's example which uses 2D array: } [ J return result; and after it's passed to your method, it correctly contains: [1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16] O [true, false, true, false], [true, false, true, false], [true, false, true, false], [true, false, true, false] Select an option below that makes a good test candidate to test a different case that shows…
What is wrong with my Java code? public static void main(String[] args) { class IncrementClass<T> { T value; } IncrementClass<String> i = new IncrementClass<>(); int[] intArray = new int[10]; for(i.value = 0; i.value<intArray.length;i.value++){ intArray[i.value]=i.value; System.out.print(intArray[i.value]); } }
Write all the code within the main method in the Test Truck class below. Implement the following functionality. a) Constructs two truck objects: one with any make and model you choose and the second object with gas tank capacity 10. b) If an exception occurs, print the stack trace. c) Prints both truck objects that were constructed. import java.lang.IllegalArgumentException ; public class TestTruck { public static void main ( String [] args ) { heres the truck class information A Truck can be described as having a make (string), model (string), gas tank capacity (double), and whether it has a manual transmission (or not). Include the following methods in your class definition. . An overloaded constructor which takes the make and model. This method throws an IllegalArgumentException if the make is "Jeep". An overloaded constructor which takes the gas tank capacity. This method throws an IllegalArgumentException if the capacity of the gas…
import java.util.Comparator; import java.util.PriorityQueue; class StringLengthComparator implements Comparator public int compare(String o1, String 02) if (01.length()02.length()){ return 1; }else{ } } } } class StringLengthComparator1 implements Comparator { return 0; public int compare(String o1, String o2) { if(01.length()02.length()){ return -1;//means here we swap it }else{ } } return 0; public class StringLength { public static void main(String[] args) { String arr[] = {"this", "at", "a", "their", "queues"}; StringLengthComparator string Comparator = new StringLengthComparator(); StringLengthComparator1 string Comparator1 = new StringLengthComparator1(); PriorityQueue pq = new PriorityQueue(stringComparator); PriorityQueue pq1 = new PriorityQueue(stringComparator1); for(int i=0;i
JAVA Language: Transpose Rotate. Question: Modify Transpose.encode() so that it uses a rotation instead of a reversal. That is, a word like “hello” should be encoded as “ohell” with a rotation of one character. (Hint: use a loop to append the letters into a new string) import java.util.*; public class TestTranspose { public static void main(String[] args) { String plain = "this is the secret message"; // Here's the message Transpose transpose = new Transpose(); String secret = transpose.encrypt(plain); System.out.println("\n ********* Transpose Cipher Encryption *********"); System.out.println("PlainText: " + plain); // Display the results System.out.println("Encrypted: " + secret); System.out.println("Decrypted: " + transpose.decrypt(secret));// Decrypt } } abstract class Cipher { public String encrypt(String s) { StringBuffer result = new…
Starter code for ShoppingList.java import java.util.*;import java.util.LinkedList; public class ShoppingList{ public static void main(String[] args) { Scanner scnr=new Scanner(System.in); LinkedList<ListItem>shoppingList=new LinkedList<ListItem>();//declare LinkedList String item; int i=0,n=0;//declare variables item=scnr.nextLine();//get input from user while(item.equals("-1")!=true)//get inputuntil user not enter -1 { shoppingList.add(new ListItem(item));//add into shoppingList LinkedList n++;//increment n item=scnr.nextLine();//get item from user } for(i=0;i<n;i++) { shoppingList.get(i).printNodeData();//call printNodeData()for each object } }} class ListItem{ String item; //constructor ListItem(String item) { this.item=item; } void printNodeData() { System.out.println(item); }}