Java }else if (target > elements[middle]){left = middle + 1;else {return middle;}return -13;4. What will print when the main method below is executed?public static void main (String[] args)int [] arr1= {-20, 3, 15, 81, 432};int index = binarySearch (arrl,15);System.out.println (index);index = binarySearch (arr1,-20);System.out.println(index);index = binarySearch(arrl,432);System.out.println(index);index = binarySearch(arrl,53);System.out.println(index);5. How many times would the while loop in the code execute ifint [] arr{2, 10, 23, 31, 55, 86}and you call binarySearch (arr, 55)?Show how you arrive at your answer. D. Il and IIl onlyQuestions 4 and 5 refer to the following code for binary search.public class SearchTestpublic static int binarySearch(int [] elements, int target) {int left = 0;int right = elements.lengthwhile (left <= right)- 1;int middle = (left + right) / 2;if (target < elements [middle]){right = middle - 1;STAR

Hello student , hope you are doing good . The answer to both of the question is attached below…

4. What will print when the main method below is executed? public static void main (String [] args) int (] arrl = {-20, 3, 15, 81, 432}; %3D int index = binarySearch(arrl,15); System.out.println (index); binarySearch (arrl, -20); System.out.println(index); index = binarySearch (arrl,432); System.out. println (index); index = index = binarySearch (arrl,53); System.out.println(index);

4. What will print when the main method below is executed? public static void main (String [] args) int (] arrl = {-20, 3, 15, 81, 432}; %3D int index = binarySearch(arrl,15); System.out.println (index); binarySearch (arrl, -20); System.out.println(index); index = binarySearch (arrl,432); System.out. println (index); index = index = binarySearch (arrl,53); System.out.println(index);

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

Similar questions

In java, the Arrays class contains a static binarySearch() method that returns …… if element is found. false true (-k–1) where k is the position before which the element should be inserted The index of the element
5.29 LAB: Is array sorted (JAVA) Write a program in java that reads a list of integers from input into an array and outputs "yes" if the list is sorted in ascending order between two provided positions. Otherwise, output "no". The first input specifies the number of items in the list. The next set of inputs is the list. The last two inputs are the start and end positions (inclusive). Assume the list contains less than 20 integers and position 1 is the first element. Ex: If the input is: 8 5 6 7 4 3 2 1 0 1 3 the output is: yes Ex: If the input is: 6 1 2 3 4 5 2 4 6 the output is: no Code starts here: import java.util.Scanner; public class LabProgram { public static void main(String[] args) { Scanner scnr = new Scanner(System.in); int[] userValues = new int[20]; // List of integers from input /* Type your code here. */ }}
Find error #include<bits/stdc++.h> using namespace std; class Solution{ public: bool isPossible(vector<int>ank,int n,int mid) { int count=0; for(int i=0;i<rank.size()) { int val= (-1 + sqrt(1+(8*mid)/rank[i]))/2; count+=val; } return count>=n; } int findMinTime(int N, vector<int>&A, int L){ int low=*min_element(A.end()),high=1000000; int ans=high; while(low<=high) { int mid=low+(high)/2; if(isPossible(A,mid)) { ans=mid; high=mid; } else low=mid; } return ans; } }; int main() { int t; cin>>t; while(t--) { int l; cin >> l; vector<int>arr(l); for(int i = 0; i < l; i++){ cin >> arr[i]; } Solution ob; int ans = ob.findMin(n, *arr, l); cout…
void func(vector<string>& names){ sort(names.begin(), names.end()); //(a) for(int i = names.size() - 1; i > 0; --i){. //(b) if(names[i] == names[i - 1]){ names[i] = move(names.back()); names.pop_back(); } } } What are the reasons or consequences for the programmer’s choice to loop backwards in the line marked (b), and under what circumstances would the algorithm behave differently if that line were replaced with: for (int i = 1; i < names.size(); ++i) ? What would change?
Modified Recursive Binary Search • Write C++ program hw7.cpp that meets the following requirements: – First, write a recursive binary search function with the following prototype: int binarySearch(int array[], int first, int last, int value); – Now suppose we have a sorted array like this: int a[SIZE] = { 3, 5, 7, 9, 22, 22, 22, 22, 30, 35, 51, 52, 73 }; – Then the following statement int index = binarySearch(a, 0, SIZE-1, 22); – would return one of the indices that match the target value (22), and it could be index 4, 5, 6, or 7. – Now, your mission is to modify this recursive binary search function to always return the leftmost index when there are multiple indices that match the target value. Thus, in the above case, the function must return index 4. – If no match found, the function returns -1. – Write a main function that checks if your modified binary search function works as expected with at least 3 example arrays. – Note: your modified binary search function must ensure the…
Lab Goal : This lab was designed to teach you more about sorting data with the built-in java sorts. Lab Description : Take a list of words and output the list in ascending order. Use Arrays.sort().Sample Data : abc ABC 12321 fred alexandera zebra friendly acrobatics 435 TONER PRinTeRb x 4 r s y $123 ABC abc 034 dog cat sally sue bob 2a2Sample Output : word 0 :: 12321word 1 :: ABCword 2 :: abcword 3 :: alexanderword 4 :: fred word 0 :: 435word 1 :: PRinTeRword 2 :: TONERword 3 :: aword 4 :: acrobaticsword 5 :: friendlyword 6 :: zebra word 0 :: $word 1 :: 4word 2 :: bword 3 :: rword 4 :: sword 5 :: xword 6 :: y word 0 :: 034word 1 :: 123word 2 :: 2a2word 3 :: ABCword 4 :: abcword 5 :: bobword 6 :: catword 7 :: dogword 8 :: sallyword 9 :: sue I need a code class and a runner class
please only c code dont use c++ and c#. Function write the arraylist_sort function and arraylist_remove_duplicates according to the given parameters. #include <stdio.h>#include <stdlib.h>#include <string.h> #define N 2000#define D 250 // A simple restaurant structuretypedef struct{char restaurant_name[15];double rating;char city[31];unsigned short opening_year;} RESTAURANT_t, *RESTAURANT; // Arraylist structuretypedef struct ArrayList_s{void **list;int size;int capacity;int delta_capacity;} ArrayList_t, *ArrayList; * Function: arraylist_sort* This generic function sorts an array list using the given compare function.*/void arraylist_sort(ArrayList l, int (*compare)(void *, void *)){// TODO: Fill this block./* NOTE: If you cannot write down a generic function which works for all types, write down a function which sorts resturants. If you cannot use function pointers, you can write down multiple functions which sort using different criteria.*/ } /*** Function:…
it Language Java 8 Autocomplete Ready O 3. Closest Numbers 1 > import java.io.*; - 14 15 class Result { 16 Given an array of distinct integers, determine the minimum absolute difference between any two elements. Print all element pairs with that minimal absolute difference in ascending order. * Example numbers = [6,2,4,10] The minimal absolute difference is 2 and the pairs with that difference are (2,4) and (4,6). When printing element pairs (1) they should be ordered ascending first by i and then by j. 17 /* 18 * Complete the closest Numbers' function below. 19 20 * The function accepts INTEGER_ARRAY numbers as parameter. 21 */ 22 23 public static void closestNumbers (List numbers) { 24 // Write your code here 25 26 } 27 28 } 29 30 > public class Solution { 2 4 4 6 Function Description Complete the function closestNumbers in the editor below. closestNumbers has the following parameter(s): int numbers[n: an array of integers Returns: NONE Line: 14 Co Test Results Custom Input Run…
i need this code with java Code: #include <bits/stdc++.h>using namespace std; class node{ public: int data; node* left; node* right;}; void printGivenLevel(node* root, int level);int height(node* node);node* newNode(int data); void reverseLevelOrder(node* root){ int h = height(root); int i; for (i=h; i>=1; i--) printGivenLevel(root, i);} void printGivenLevel(node* root, int level){ if (root == NULL) return; if (level == 1) cout << root->data << " "; else if (level > 1) { printGivenLevel(root->left, level - 1); printGivenLevel(root->right, level - 1); }} int height(node* node){ if (node == NULL) return 0; else { int lheight = height(node->left); int rheight = height(node->right); if (lheight > rheight) return(lheight + 1); else return(rheight + 1); }} node* newNode(int data){ node* Node = new…
please i need this cood with java Code: #include <bits/stdc++.h>using namespace std; class node{ public: int data; node* left; node* right;}; void printGivenLevel(node* root, int level);int height(node* node);node* newNode(int data); void reverseLevelOrder(node* root){ int h = height(root); int i; for (i=h; i>=1; i--) printGivenLevel(root, i);} void printGivenLevel(node* root, int level){ if (root == NULL) return; if (level == 1) cout << root->data << " "; else if (level > 1) { printGivenLevel(root->left, level - 1); printGivenLevel(root->right, level - 1); }} int height(node* node){ if (node == NULL) return 0; else { int lheight = height(node->left); int rheight = height(node->right); if (lheight > rheight) return(lheight + 1); else return(rheight + 1); }} node* newNode(int data){ node*…
string camelCaseConcatenate(vector<string> words, bool u){ // {"hello", "User", "c", "Java"} -> HellouserC++java // if u is true then first character of output string should be uppercase // concatenate strings in the vector in camelcase order // all words are made of alphabets only // complete the function}
Add each element in origList with the corresponding value in offsetAmount. Print each sum followed by a space. Ex: If origList = {40, 50, 60, 70} and offsetAmount = {5, 7, 3, 0}, print: 45 57 63 70 #include <iostream>#include <vector>using namespace std; int main() {const int NUM_VALS = 4;vector<int> origList(NUM_VALS);vector<int> offsetAmount(NUM_VALS);unsigned int i; for (i = 0; i < origList.size(); ++i) {cin >> origList.at(i);} for (i = 0; i < offsetAmount.size(); ++i) {cin >> offsetAmount.at(i);} cout << endl; return 0;} Please help me with this problem using c++.