Answered: 10. Implement Binary search algorithm…

10. Implement Binary search algorithm to search a number in the sorted array of integers given below: int sA[10] = {1,2,3,4,5,6,7,8,9,10} Read input a number from the user and search it in the array.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 15PE

See similar textbooks

Related questions

Q: solve in python coding 3. Selection Sort • The idea in a selection sort is that you locate the…

A: CODE: def index(array,step,size,min_index): for i in range(step + 1, size): if array[i]…

Q: Code in Python Q) Write a function to sort given array using Selection sort algorithm and returns…

A: SELECTION SORT is a comparison sorting algorithm that is used to sort a random list of items in…

Q: Perform insertion sort on the following array: [5, 2, 1, 3, 6, 4]. Show what the array looks like…

A: 5 2 1 3 6 4 2 5 1 3 6 4 1 2 5 3 6 4 1 2 3 5 6 4 1 2 3 5 6 4 1 2 3 4 5 6

Q: Q.1. Implement insertion sort using C++ STL with following constrain and write a program : The…

A: Note- As per the Bartley policy we have to attempt only one question. Program Explanation- Insert…

Q: Rewrite the function pfind which searches an array for a specific value, and returns a pointer to…

A: #include <iostream> #include <algorithm> using namespace std; //this is your required…

Q: Assume the following list of keys: 28, 18, 21, 10, 25, 30, 12, 71, 32, 58, 15 This list is to be…

A: Answer : here Is the C++ code for insertion sort #include<iostream>using namespace…

Q: Given a sorted list of integers, output the middle integer. A negative number indicates the end of…

A: Step 1 I have the input for the array, but the problem is when I get to finding the middle element…

Q: #include <stdio.h> int main() { int x[a][w]; int k, l, n, tmp;…

A: Declared variables 'a' and 'w' as constant of type integers with size 100. A prompt asking user to…

Q: orting Consider the following array of int values. [17, 11, 6, 22, -3, 8, 4, 22, 2, 35, -4, 10] a.…

A: Actually, array is an collection of elements.

Q: Chocolate Factory A chocolate factory is packing chocolates into the packets. The chocolate packets…

Q: Write down the algorithm for binary search. f. Using binary search, write a program in c++ that will…

A: Binary Search algorithm: The binary search algorithm is used to search the location of an element…

Q: Q5) Assume you have 2D array Z with (5x5) elements. Write a C++ program to create another array B…

A: Code: #include <bits/stdc++.h>using namespace std;// function to swap the two elementvoid…

Q: . Sorting • Begin by filling an array with random numbers: import numpy as np np.random.seed(1012)…

A: The answer is given below.

Q: 3. Make p2 point to the last negative value in M. 4. Make pl and p2 point to array locations index…

A: 7. Here p1 points to index 15 and p2 points to index 33 So the code would be int product=1; for(int…

Q: Complete the following function definition to recursively print the index of a unique value in an…

A: we have to write all code in the blanks

Q: Array a= { 6,1.10, 9, 7, 4, 8, 2, 15 }; After the second iteration of the quick sort the array…

A: Answer: Option d a={1 2 4 6 7 9 8 10 15}

Q: Rewrite the function pfind which searches an array for a specific value, and returns a pointer to…

A: ALGORITHM:- 1. Initialize a array. 2. Take input for the number to be searched. 3. Call the…

Q: 10. Implement Binary search algorithm to search a number in the sorted array of integers given…

A: Binary search is an efficient algorithm for finding an item from a sorted list of items.

Q: Create a function that returns the majority vote in an array. A majority vote is an element that…

A: To solve this problem we will be using the PHP programming language. Input - List of strings.…

Q: Consider the following array of int values. [17, 11, 6, 22, -3, 8, 4, 22, 2, 35, -4, 10] Write the…

A: Selection sort: Elements in array: [17, 11, 6, 22, -3, 8, 4, 22, 2, 35, -4, 10] Pass 1: Find the…

Q: 23 37 56 74 80 90 112 114 123 129 208 249 266 270 271 Suppose you use binary search to search for…

A: Key = 129 First iteration: low = 0 high = 14 mid = (low + high)/2 = (0 + 14)/2 = 7 arr[mid] = 114…

Q: 1. An ordered sequence of numbers from 1 to N is given. One number might have deleted from it, then…

A: C++ Program for above : #include <iostream> #include <stdlib.h> #include <list>…

Q: Display the array given below after sorting it using the Bubble sort algorithm. int arr[10] =…

A: Given: An integer array of size 10 is given. int arr[10] = {10,5,3,8,3,7,2,4,9,5} Requirement:…

Q: 1. Sorting • Begin by filling an array with random numbers: import numpy as np np.random.seed(1012)…

A: Array An array is a set of related data elements kept in close proximity to one another in memory.…

Q: quickSort(T,0,7) partition (T,0,7) = [0] [1] [2] _ [3] _ [0 5 O [7] 10 20 80 T 40 60 5 50 55 bottom…

A: Quicksort is a type of sorting algorithm based on the divide and conquer approach. It divides the…

Q: Take number n from user and create an array A of random integers of size n. The size of n can be in…

A: Program: //main.cpp #include <iostream> //header file for cin,cout and endl #include…

Q: Perfect number, is defined as a positive integer which is equal to the sum of all its proper…

A: A perfect number means a number which is the sum of its divisors excluding itself. As per details…

Q: Task 05: An r-combination of elements of a set is an unordered selection of r elements from the set.…

A: As per our policy As the programming languages is not mentioned i am solving the question using…

Q: Arrays.sort() uses dual-pivot quicksort, an optimized version of quicksort, to sort an array of n…

A: When we use dual-pivot quicksort Arrays.sort() O(n^2) = worst case time complexity Timesort is…

Q: Consider the array: 42 88|4| 89)|72|4561|34| If these items are sorted into ascending order by the…

A: Answer: 4,9,34,42,72,88,889,4561

Q: Write the code to determine if an item in in the array.

A: Approach: Here, we use a linear search that compares an item to be searched with each array element.…

Q: Given an Array M of 99 int values, and int *pit: 1. Declare two pointers p1 and p2 2. Make pl point…

A: Write a program on the above-given conditions in c++ without using the std::rand()

Q: Q1. Write a program to do the following : (1) Declare an array a of size 10 and three pointer…

A: Hello Student. Greetings from my side. Hope you are doing great. I will try my best to answer your…

Q: Question 3: r" An array listA is called balanced if it stores the same count of even and odd…

A: Step-1: Start Step-2: Declare and input an array 'listA' of size 10 Step-3: Print array listA…

Q: is an ordered which consists of varying number of elements. O a. Array and List O b. Array O c. None…

A: NOTE: Since language is not mentioned. Therefore answering the question in Java language. In this…

Q: Write a function that removes the duplicate items from an unsorted array entered by the user and…

A: Program: #include <stdio.h> void removeDuplicate(int arr[], int n) { int j = 0; int…

Q: (c) A palindromic number is a number that is the same if read forwards or backwards: 12321 and…

A: Note: This question is solved using the c++ programming language since no programming language was…

Q: (c) A palindromic number is a number that is the same if read forwards or backwards: 12321 and…

A: Palindrome number is a number which is read same from backwards as well as front. It means reverse…

Q: solve this by c programming Write a program that deletes the first element in an array which…

A: The program is implemented in C using structured approach. We have made a separate function which…

Q: Create a function that returns the majority vote in an array. A majority vote is an element that…

A: The above question is solved in step 2 :-

Q: Programming Exercise 5: You are to design a program to create five two-element word arrays (AAA,…

A: Given : You are to design a program to create five two-element word arrays (AAA, BBB, CCC, DDD,…

Q: Code in Python Q) Write a function to sort given array using Bubble sort algorithm and returns the…

A: Given: Code in Python Q) Write a function to sort given array using Bubble sort algorithm and…

Q: Assume that insertion sort is being run on the below array. The algorithm is about half way through…

A: Given: Assume that insertion sort is being run on the below array. The algorithm is about half way…

Q: Create a function that returns the majority vote in an array. A majority vote is an element that…

A: function majorityVote(arr) { for(let j = 0; j < arr.length; j++){ if(howMany(arr, arr[j])…

Q: 2. (a) Write an algorithm in pseudo-code that • takes as input an array A[1...n], and an item M…

A: Below is the complete solution with C program taking an array A and element M and returns the last…

Q: Write in the program hash/associative operations a language array/dictionary hash/associative…

A: Solution: Perl is a high level programming language which is developed for text manipulation and…

Q: Let array A] = (20, 22, 33, 36, 38, 49, 50, 61,63, 73, 74, 77, 85, 90, 97, 99} and the search key K…

A: Objective: Given an array naming 'A' with 16 integers and an element to be found in this array. The…

Q: Write a program to find the number of comparison using sequentialSearch and binarySearch algorithms…

A: While doing programming in any programming language, you need to use various variables to store…

Q: Q2. Write a program to read n integers in an array. Find the largest and smallest number using…

A: #include<iostream>using namespace std;/*main function*/int main(){ /*variables*/ int…

Concept explainers

Fundamentals of Multithreaded Algorithms

An algorithm that executes a single instruction in a uniprocessor system is called a serial algorithm. In the case of a multiprocessor computer system, a multiprocessor computer can execute multiple instructions in parallel. A multithreaded algorithm is an algorithm that enables multiple instances of the code to be executed concurrently.Multithreading is a concept that allows the CPU to execute threads independently while sharing similar resources. It is an important CPU feature that works on the process. Thread is a sequence of instructions that executes in parallel with other threads. Because of multithreading, multiple tasks can be performed within a single process, making the execution faster.

Question

C++ programming language.

10. Implement Binary search algorithm to search a number in the sorted array
of integers given below:
int sA[10] = {1,2,3,4,5,6,7,8,9,10}
Read input a number from the user and search it in the array.

Process by which instructions are given to a computer, software program, or application using code.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Requirement:

VIEW

Algorithm and Sorted Array:

VIEW

Code Screenshot:

VIEW

Output Screenshot:

VIEW

Step by step

Solved in 4 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Fundamentals of Multithreaded Algorithms

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

4. Write a program to find kth smallest element in unsorted array?You are given an unsorted array of numbers and k, you need to find the kth smallest number in the array. Forexample if given array is {1, 2, 3, 9, 4} and k=2 then you need to find the 2nd smallest number in the array,which is 2.
solve in python coding 3. Selection Sort• The idea in a selection sort is that you locate the largest item out of a set ofunsorted items, and move it into position at the end of the unsorted items. Asorted region grows one item at a time, while an unsorted region shrinks.• As done in Part 1, fill an array with random numbers.• Write a function that locates the largest element in the portion of the arraybeginning at the start of the array, up to a given index, and swaps the largestitem with the item at the given index.• E.g. If searching a[0] to a[7] locates the largest item at a[4], a[4] and a[7] would beswapped.• Write a second function that calls the first function repeatedly, until the entirearray is sorted. (Each time the first function is called, it will search one fewerelement)
6. Read in two integers n and m (n, m < 50). Read n integers in an array A. Read m integers in anarray B. Then do the following (write separate programs for each, only the reading part iscommon).a) Find if there are any two elements x, y in A and an element z in B, such that x + y = z.b) Copy in another array C all elements that are in both A and B (intersection).c) Copy in another array C all elements that are in either A and B (union).d) Copy in another array C all elements that are in A but not in B (difference).Do In c Program
1. Write a program that compares all four advanced sorting algorithms discussed in this chapter. To perform the tests, create a randomly generatedarray of 1,000 elements. What is the ranking of the algorithms? What happens when you increase the array size to 10,000 elements and then 100,000elements?
The code below computes the intersection (the number of entries shared by two arrays). It is assumed that neither array contains any duplicates. It computes the intersection by sorting one array (array b) and then iterating over array a to see if each value is in b (through binary search). What is its duration? nt intersection(int[] a, int[] b) {mergesort(b);}int intersect = 0;for (int x : a) {if (binarySearch(b, x) >= 0) {intersect++;return intersect; }}
using java programming int a[] = {5,10,4,20,1,7}; 1- search for the smallest element in array 2-if you found the smallest element in the array :swap the first element with the smallest element
9.1.1: Output numbers in reverse. Write a program that reads a list of 10 integers, and outputs those integers in reverse. For coding simplicity, follow each output integer by a space, including the last one. Then, output a newline. Ex: If the input is 2 4 6 8 10 12 14 16 18 20, the output is: 20 18 16 14 12 10 8 6 4 2 To achieve the above, first, read the integers into an array. Then output the array in reverse. CODES in Coral Language
Binary Search in descending order We have learned and practiced the implementation of the binary search approach that works on an array in ascending order. Now let’s think about how to modify the above code to make it work on an array in descending order.
Question1: implement lab 3 by the two-dimensional array. ask the user to give you a number of rows and the number of columns. and then you define a two-dimensional array. then your program will print the multiplication table according to the numbers that the user gave. C++
Consider the following array of int values. [17, 11, 6, 22, -3, 8, 4, 22, 2, 35, -4, 10] Write the contents of the array after 4 passes of the outermost loop of selection sort. Assume selection sort is sorting slots from low-to-high Write the contents of the array during each of the the recursive calls of merge sort.
java: // Class to do MergeSort and QuickSort on int arrays and test them public class MergeQuickSorts { // Create a main to test MergeSort and QuickSort for // three cases - Sorted Aray, Reverse Sorted Array, Random Array // Each array should be size 50 // For the sorted array use the entries 1, 2, 3......50 // For the reverse sorted array use the entries 50, 49, 48.....1 // For the random array use ints between 1 and 50 inclusive, duplicates allowed // For each of the 6 sorts print the array before and after the sort // and show clearly which sort is being done public static void main(String[] args) { }
Take number n from user and create an array A of random integers of sizen. The size of n can be in the order of billion (10^9).a) Find the largest element LP and smallest element SP of the array.b) Swap the position of Largest element and Smallest element in the array callingfunction SWAP (A, LP, SP) by pointer (not reference).c) Then calculate the cumulative sum of the numbers in the array A and put it in thesame array A.