please find: indexes examined and value returned Suppose we are performing a binary search on a sorted vector initialized as follows:23456// index Ø 17 8 9 10 11 12 13 14 15 16vector numbers { 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34};int index = binarySearch (numbers, 28);Write the indexes of the elements that would be examined by the binary search (the mid values in our algorithm's code) andwrite the value that would be returned from the search.

Suppose we are performing a binary search on a sorted vector initialized as follows: // index Ø vector numbers { 2, int index = binarySearch (numbers, 28); 1 5 6 7 8 9 10 11 12 13 14 15 16 2 3 4 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34); Write the indexes of the elements that would be examined by the binary search (the mid values in our algorithm's code) and write the value that would be returned from the search.

Suppose we are performing a binary search on a sorted vector initialized as follows: // index Ø vector numbers { 2, int index = binarySearch (numbers, 28); 1 5 6 7 8 9 10 11 12 13 14 15 16 2 3 4 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34); Write the indexes of the elements that would be examined by the binary search (the mid values in our algorithm's code) and write the value that would be returned from the search.

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

Suppose we are performing a binary search on a sorted vector initialized as follows: // index 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 vector<int>numbers {-5, -1, 0, 3, 9, 14, 19, 24, 33, 41, 56, 62, 70, 88, 99}; int index=binarySearch(numbers, 18); Write the indexes of the elements that would be examined by the binary search (the mid values in our algorithm's code) and write the value that would be returned from the search. please find : indexes examined and value returned
Suppose we are performing a binary search on a sorted vector initialized as follows: // index 0 1 2 3 4 5 6 7 8 9 10 11 12 13vector<int>numbers {-23, -5, 9, 14, 15, 18, 23, 24, 25, 29, 34, 62, 85, 87};intindex=binarySearch(numbers, 25); Write the indexes of the elements that would be examined by the binary search (the mid values in our algorithm's code) and write the value that would be returned from the search. Now suppose we are performing both an iterative (loop-based) sequential search and then a recursive binary search on the same list. The sequential search is a standard version that does not take any advantage of the sortedness of the list, simply looking each element in order from the start to the end of the list. Suppose we are searching the list for the value 25. Also suppose that we are operating on a special computer where reading an element's value in the list (such as examining the value of numbers[0]) costs 7 units of time; calling any…
Suppose we are performing a binary search on a sorted vector initialized as follows: // index 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 vector<int> numbers{ 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34}; int index = binarySearch(numbers, 28); Write the indexes of the elements that would be examined by the binary search (the mid values in our algorithm's code) and write the value that would be returned from the search. NOTE: When writing the indexes (mid values), separate them by comma followed by spaced. Example: 7, 3, 5 find: indexes examined value returned
Write the state of the elements of the vector below after each of the first 4 passes of the outermost loop of the insertion sort algorithm. (After the first pass, 2 elements should be sorted. After the second pass, 3 elements should be sorted. And so on.) // index 0 1 2 3 4 5 6 7 vector<int> numbers{29, 17, 3, 94, 46, 8, -4, 12}; insertionSort(numbers); NOTE: Write your answer inside curly braces with numbers separated by commas {29, 17, 3, 94, 46, 8, -4, 12} after pass 1 after pass 2 after pass 3 after pass 4
please convert the code to C language //C++ program to check if two arrays //are equal or not #include <bits/stdc++.h>using namespace std; bool similar_array(vector<int> arr1, vector<int> arr2){ //create teo different hash table where for each key //the hash function is h(arr[i])=arr[i] //we will use stl map as hash table and //will keep frequency stored //so say two keys arr[0] and arr[5] are mapping to //the same location, then the location will have value 2 //instead of the keys itself //if two hash tables are exactly same then //we can say that our arrays are similar map<int, int> hash1; map<int, int> hash2; //for each number for (int i = 0, j = 0; i < arr1.size(); i++, j++) { hash1[arr1[i]]++; hash2[arr2[i]]++; } //now check whether hash tables are exactly same or not for (auto it = hash1.begin(), ij = hash2.begin(); it != hash1.end() && ij != hash2.end(); it++, ij++) {…
please convert the code to C language // C++ program to find maximum distance between // two occurrences of same element in array#include <bits/stdc++.h>using namespace std; int maximum_distance_bw_occurences(vector<int> arr, int n){ //create a hash table where for each key the //hash function is h(arr[i])=arr[i] //we will use stl map as hash table and //will keep i stored(i of arr[i]) //so say two keys arr[0] and arr[5] are mapping //to the same location, then the location will have value 0,5 //instead of the keys itself map<int, vector<int> > hash; //for each number for (int i = 0; i < arr.size(); i++) { hash[arr[i]].push_back(i); } //now to find max distance b/w two occurrences //we need to check difference b/w first and //last position for each unique keys //maxdiff=max(last-first) for each unique key int maxdiff = 0; for (auto it = hash.begin(); it != hash.end(); it++) { int first…
Create a merge-sort multithread.A is an array, and p and q are array indexes used to sort the sub-array A[p..r]. B is a subarray that will be filled by the sort. A p-merge-sort(A,p,r,B,s) call sorts items from A[p..r] and places them in B[s..s+r-p].
import java.util.Scanner;import java.util.ArrayList; public class UserIDSorting {// TODO: Write the partitioning algorithm - pick the middle element as the // pivot, compare the values using two index variables l and h (low and high), // initialized to the left and right sides of the current elements being sorted,// and determine if a swap is necessarypublic static int partition(ArrayList<String> userIDs, int i, int k) {} // TODO: Write the quicksort algorithm that recursively sorts the low and // high partitionspublic static void quicksort(ArrayList<String> userIDs, int i, int k) {} public static void main(String[] args) {Scanner scnr = new Scanner(System.in); ArrayList<String> userIDList = new ArrayList<String>(); String userID; userID = scnr.next();while (!userID.equals("-1")) {userIDList.add(userID);userID = scnr.next();}// Initial call to quicksort quicksort(userIDList, 0, userIDList.size() - 1); for (int i = 0; i < userIDList.size(); ++i)…
Write a recursive function named binarySearch that accepts a reference to a sorted vector of integers and an integer target value and uses a recursive binary search algorithm to find and return an index at which that target value is found in the vector. If the target value is not found in the vector, return -1. The following code shows some example calls and their expected return values: // index 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16vector<int>v {-4, 2, 7, 10, 15, 20, 22, 25, 30, 36, 42, 50, 56, 68, 85, 92, 103};intindex=binarySearch(v, 42); // 10intindex=binarySearch(v, 66); // -1 You should assume that the vector's elements are already sorted; you do not need to handle the case of an unsorted vector. Your function must be recursive and must use a binary search algorithm. Do not use loops or auxiliary data structures.
Write a program that implements a sorted list using dynamic allocated arrays. DataFile.txt contains the information of poker cards. C: clubs(lowest),D: diamonds, H: hearts, S:spades(highest) 2 (lowest), 3, 4, 5, 6, 7, 8, 9, 10, J, Q, K, A No Joker cards Any C cards are lower than any D cards. DataFile Content(You can write the file specification into your program.): H4,C8,HJ,C9,D10,D5,DK,D2,S7,DJ,H3,H6,S10,HK,DQ,C2,CJ,C4,CQ,D8,C3,SA,S2,HQ,S8,C6,D9,S3,SQ ,C5,S4,H5,SJ,D3,H8,CK,S6,D7,S9,H2,CA,C7,H7,DA,D4,H9,D6,HA,H10,S5,C10 H4, D5, HK, D2 H4, HK, SK C9,C10 For examples, DJ means J of Diamonds;H7 means 7 of hearts. Your job Create a list by dynamic allocated array and set the size to 20 Read the first 20 cards in the first line of the file, the put them one by one into the list by implementing and using putItem(). The list must be kept sorted in ascending order. Then print out all the cards in the list in one line separating by commas. Then delete the cards indicated in the second…
Which of the following is true about searching elements in an ordered array? You cannot use binary search on an ordered array so the performance is O(n) If there are no holes in the array and the elements are all next to each other, then the performance for search improves to O(1) If you do a linear search on a sorted array, the performance improves to O(log n) Which of the following is true about the insertBeforeCurrent function for a Circular Linked List (CLL) like you did in programming exercise 1? If the CLL is empty, you need to create the new node, set it to current, and have its next pointer refer to itself The worst case performance of the function is O(n) If you insert a new element with the same data value as the current node, the performance improves to O(log n)
this function c++ accept vector , replace this vector to array void merge_sort_4(vector<int> lst,int start,int end){if (start < end){int quarter1 = (start + end) / 4;int quarter2 = (start + end) / 2;int quarter3 = (end - quarter1 - 1); merge_sort_4(lst, start, quarter1);merge_sort_4(lst, quarter1 + 1, quarter2);merge_sort_4(lst, quarter2 + 1, quarter3);merge_sort_4(lst, quarter3 + 1, end); merge4(lst, start, quarter1, quarter2, quarter3, end);}}void merge4(vector<int> lst,int start,int q1,int q2,int q3,int end){vector<int> first_q_list;for(int i=start;i<q1+1;i++)first_q_list.push_back(lst[i]);vector<int> sec_q_list;for(int i=q1+1;i<q2+1;i++)sec_q_list.push_back(lst[i]);vector<int> third_q_list;for(int i=q2+1;i<q3+1;i++)third_q_list.push_back(lst[i]);vector<int> last_q_list;for(int i=q1+1;i<end+1;i++)last_q_list.push_back(lst[i]);int…