Create a program that uses an STL algorithm to perform a binary search that checks whether a number is in a sequence of sorted numbers.ConsoleBinary Search program Enter 0 to exit Numbers: 13, 16, 18, 29, 32, 71, 71, 77, 78, 90 Enter a number from 1 to 100: 11 is NOT in numbers. Enter a number from 1 to 100: 3232 is in numbers. Enter a number from 1 to 100: 100100 is NOT in numbers. Enter a number from 1 to 100: 0Bye!SpecificationsThe program should begin with a list of 10 integers from 1 to 100 (both inclusive).The program should allow the user to enter a number from 1 to 100. Then, it should display whether that number is or isn’t in the list of numbers.The program should use an STL algorithm to sort the numbers.The program should use an STL binary search algorithm to search the list of numbers.

Code: #include <bits/stdc++.h>using namespace std;int checkNumPresent(int arr[], int start,…

Answered: ole Binary Search program Enter 0 to…

Engineering

Computer Science

ole Binary Search program Enter 0 to exit Numbers: 13, 16, 18, 29, 3

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 21PE

See similar textbooks

Console

Binary Search program

Enter 0 to exit

Numbers: 13, 16, 18, 29, 32, 71, 71, 77, 78, 90

Enter a number from 1 to 100: 1

1 is NOT in numbers.

Enter a number from 1 to 100: 32

32 is in numbers.

Enter a number from 1 to 100: 100

100 is NOT in numbers.

Enter a number from 1 to 100: 0

Bye!

Specifications

The program should begin with a list of 10 integers from 1 to 100 (both inclusive).
The program should allow the user to enter a number from 1 to 100. Then, it should display whether that number is or isn’t in the list of numbers.
The program should use an STL algorithm to sort the numbers.
The program should use an STL binary search algorithm to search the list of numbers.

Process or set of rules that allow for the solving of specific, well-defined computational problems through a specific series of commands. This topic is fundamental in computer science, especially with regard to artificial intelligence, databases, graphics, networking, operating systems, and security.

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

Step 3

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 2 images

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

Write a program to place ten queens on 10 x 10 chessboard in such a way that one queen is to bein each row. A program will use 2 DIMENIONAL array x[r][c] to do this configuration. If x[r] hasvalue c, then in row r there is a queen in column c. Write a program that asks a user to enter thecolumns that contain queens in the ten rows. The program then places the queens in thesecolumns (one per row) and prints the board.
java: Run length coding is a method to represent a string in a more compact manner. Each character that occurs more than 2 times in a row is represented by the character and a number following it. Two examples are: "abba" → "abba""abcccbbbba" → "abc3b4a"Write a function that calculates how many characters the encoded string is shorter than the original.
Help me please... Create a program that would accept 10 strings from the user (each string has a maximum of 10 characters, letters only, no spaces). Your goal now is to sort them in lexicographical order (dictionary order) regardless of the case. You need to implement the functions toLowerCase and toUpperCase. You are free to use any sorting algorithm discussed. Example: Give me word number 1: banana Give me word number 2: apple Give me word number 3: asdfer Give me word number 4: zerosx Give me word number 5: banerZ Give me word number 6: ApPle Give me word number 7: ChoP Give me word number 8: chop Give me word number 9: ZerosX Give me word number 10: zErosx
The sieve of Eratosthenes is a way of computing all the prime numbers below a certain number. (A prime number is a number that is only divisible by itself and 1). This algorithm is explained excellently in this video (Links to an external site.), or you can read about this ancient algorithm on Wikipedia (Links to an external site.). Implement this algorithm: Implement a function cross_out_multiples that takes as arguments a list of boolean values (true/false) called is_prime and a number n. The function sets the boolean values at all multiples of n (2*n, 3*n, 4*n ...) that are in the list to false. Implement a function sieve(n) which gives back a list of all primes below n. Needs to written in Python with the use of funtions and input parcers
IN C PROGRAMMING LANGUAGE AND COMMENT EVERY LINE SO I COULD UNDERSTAND EVERY STEP PLEASE, Write a program that implements the binary search for a set of integers stored in a data file. (Note that the data set in sorted in an ascending order).
/* segvhunt.cFind and eliminate all code that generates Segmentation Fault*/#include <stdio.h>int main() {char **s;char foo[] = "Hello World";*s = foo;printf("s is %s\n",s);s[0] = foo;printf("s[0] is %s\n",s[0]);return(0);}
Exercise Fibonacci (Overflow): Write a program called FibonacciInt to list all the Fibonacci numbers, which can be expressed as an int (i.e., 32-bit signed integer in the range of [-2147483648, 2147483647]). The output shall look like: F(0) = 1 F(1) = 1 F(2) = 2 ... F(45) = 1836311903 F(46) is out of the range of int Hints: The maximum 32-bit int is kept in constant Integer.MAX_VALUE. You cannot use F(n-1) + F(n-2) > Integer.MAX_VALUE to check for overflow. Instead, overflow occurs for F(n) if (Integer.MAX_VALUE – F(n-1)) < F(n-2), i.e., no room for the next number. Try: Write a similar program for Tribonacci numbers. Exercise NumberConversion: Write a method call toRadix() which converts a positive integer from one radix into another. The method has the following header: public static String toRadix(String in, int inRadix, int outRadix) // The input and output are treated as String. Write a program called NumberConversion, which prompts the user for an input number, an input…
(Java) Write a program that uses String method regionMatches to compare two strings input by the user. The program should prompt the user to enter two strings, the starting index in the first string, the starting index in the second string, and the number of characters to be compared. The program should print whether or not the strings are equal. (Ignore the case of the characters during comparison.) Standard output: Enter·first·string:Enter·second·string:Enter·starting·index·for·first·string:Enter·starting·index·for·second·string:Enter·number·of·characters·to·be·compared:true↵
In python, The function decodeFromAscii takes a list L of integers in the range 32 through 126. Each item in L is an ASCII code representing a single printable character. The function accumulates the string of characters represented by the list of ASCII codes and returns that string. For example, decodeFromAscii([78, 105, 99, 101, 33]) returns "Nice!" because N is chr(78), i is chr(105), c is chr(99), etc. Note: ASCII was created in the 1960's so programmers could have a standard encoding for common keyboard characters as numbers. It was later expanded to create Unicode so that characters from languages other than English, mathematical symbols, and many other symbols could also be represented by numerical codes. For example: Test Result print(decodeFromAscii([36, 49, 44, 48, 48, 48])) $1,000 print(decodeFromAscii([115, 110, 111, 119])) snow
javascript only: Write a function `popularLetters(string)` that takes a string as an argument and returns an array of all of the characters that appear five or more times in the string. Examples: console.log(popularLetters('apple')); // [] console.log(popularLetters('bananas in pajamas')); // [ 'a' ] console.log(popularLetters('Yes, we have no bananas, we have no bananas today!')); // [ 'e', ' ', 'a', 'n' ]
Need the code adjusted to search for 50. With the end results matching the attached data. import java.util.Random;import java.util.Arrays;public class Lab6 {public static void main(String args[]) {int[] n= {2500, 5000, 10000, 20000, 40000};for(int i=0; i<n.length; i++) {int[] arr1 = getRandIntArray(n[i]);Arrays.sort(arr1);long startTime = System.nanoTime();// linearlinearSearch(arr1, 50);// search 50 (this number is not in array)// search a number outside the range (-10, 200)// search a number that is inside the array (100)long stopTime = System.nanoTime();System.out.println("for array size: "+n[i]+" Execution time linear: "+(stopTime - startTime)/1000.0 + " microSec");startTime = System.nanoTime();// binarybinarySearch(arr1, 50);stopTime = System.nanoTime();System.out.println("for array size: "+n[i]+" Execution time binary: "+(stopTime - startTime)/1000.0 + " microSec");}}public static void linearSearch(int[] arr, int search_item) {for(int i=0; i<arr.length; i++)…
Can you fix this please? with 5 53 5099 1223 567 17 4 1871 8069 3581 6841 #include <iostream>using namespace std; const int SORT_MAX_SIZE = 8; bool IsPrimeRecur(int dividend, int divisor) { if (divisor == 1) { return true; } if (dividend % divisor == 0) { return false; } return IsPrimeRecur(dividend, divisor-1);} bool IsArrayPrimeRecur(int arr[], int size, int index) { cout << "Entering IsArrayPrimeRecur" << endl; if (index == size) { cout << "Leaving IsArrayPrimeRecur" << endl; return true; } if (!IsPrimeRecur(arr[index], arr[index]-1)) { cout << "Leaving IsArrayPrimeRecur" << endl; return false; } return IsArrayPrimeRecur(arr, size, index+1);} bool IsArrayPrimeIter(int arr[], int size) { cout << "Entering IsArrayPrimeIter" << endl; for (int i = 0; i < size; i++) { for (int j = 2; j < arr[i]; j++) { if (arr[i] % j == 0) {…