1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
fgiga [73]
2 years ago
12

You are asked to simulate a binary search algorithm on an array of random values.An array is the list of similar type of element

s. For the sake of comparison use an integer array for implementing the search.
Hint: For a binary search you need the array as sorted and so apply the selection sort first and then apply the binary search.
Syntax of an array:
int numbers[10];
int numbers[] = { 10, 20, 30, 40 };
int numbers[4] = { 10, 20, 30, 40 };
int numbers[3] = { }; int numbers[3] = {0};
To read a sequence of numbers in an array:
for (int i =0; i> arr[i];}
Similarly to print an array:
for( int i = 0; i {cout<<"The array element at position " < A report should include the following information
Problem statement
Should have a short statement of the problem, object or purpose
Input/output description
Algorithm and Flowchart
Program listing
Sample test run of the program
Conclusions
All C++ programming project

Computers and Technology
1 answer:
Alex Ar [27]2 years ago
8 0

Answer:

Explanation:

Problem statement:

to simulate a binary search algorithm on an array of random values.

Binary Search: Search a sorted array by repeatedly dividing the search interval in half. Begin with an interval covering the whole array. If the value of the search key is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise narrow it to the upper half. Repeatedly check until the value is found or the interval is empty.

Input/output description

Input:

Size of array: 4

Enter array:10  20 30 40

Enter element to be searched:40

The Output will look like this:

Element is present at index 3

Algorithm and Flowchart:

We basically ignore half of the elements just after one comparison.

Compare x with the middle element.

If x matches with middle element, we return the mid index.

Else If x is greater than the mid element, then x can only lie in right half subarray after the mid element. So we recur for right half.

Else (x is smaller) recur for the left half.

The Flowchart can be seen in the first attached image below:

Program listing:

// C++ program to implement recursive Binary Search

#include <bits/stdc++.h>

using namespace std;

// A recursive binary search function. It returns

// location of x in given array arr[l..r] is present,

// otherwise -1

int binarySearch(int arr[], int l, int r, int x)

{

   if (r >= l) {

       int mid = l + (r - l) / 2;

       // If the element is present at the middle

       // itself

       if (arr[mid] == x)

           return mid;

       // If element is smaller than mid, then

       // it can only be present in left subarray

       if (arr[mid] > x)

           return binarySearch(arr, l, mid - 1, x);

       // Else the element can only be present

       // in right subarray

       return binarySearch(arr, mid + 1, r, x);

   }

   // We reach here when element is not

   // present in array

   return -1;

}

int main(void)

{ int n,x;

cout<<"Size of array:\n";

cin >> n;

int arr[n];

cout<<"Enter array:\n";

for (int i = 0; i < n; ++i)

{ cin >> arr[i]; }

cout<<"Enter element to be searched:\n";

cin>>x;

int result = binarySearch(arr, 0, n - 1, x);

   (result == -1) ? cout << "Element is not present in array"

                  : cout << "Element is present at index " << result;

   return 0;

}

The Sample test run of the program can be seen in the second attached image below.

Time(sec) :

0

Memory(MB) :

3.3752604177856

The Output:

Size of array:4

Enter array:10  20 30 40

Enter element to be searched:40

Element is present at index 3

Conclusions:

Time Complexity:

The time complexity of Binary Search can be written as

T(n) = T(n/2) + c  

The above recurrence can be solved either using Recurrence T ree method or Master method. It falls in case II of Master Method and solution of the recurrence is Theta(Logn).

Auxiliary Space: O(1) in case of iterative implementation. In case of recursive implementation, O(Logn) recursion call stack space.

You might be interested in
How do science, mathematics, and technology each influence engineering
Cerrena [4.2K]

Answer:

In order to start engineering you must know the basics Science, Math, and Technology. For example you need math to get all the parts in the right place and fix any pieces that need to be angled right, science because you need to know what happens if you put this with that if it’ll spark break or anything, and technology because you need to know the different pieces and their purpose, hope it helps!

Explanation:

6 0
3 years ago
Read 2 more answers
What is meant by concentration of a solution​
Bad White [126]

Answer:

The concentration of a solution means the amount of solute present in a given or specific amount of solution. (presented in percentage)

For example, the Normal Saline solution normally used for different scientific experiment or so. The saline water has 0.9% of salt (sodium chloride). This is the concentration of solution of salt.

5 0
3 years ago
Read 2 more answers
You want to find the distance between two points.
maks197457 [2]

Answer:

For the first picture, choose the second pair, and for the second one, choose the first pair

Explanation:

5 0
3 years ago
Which method is useful for dimensionality reduction especially for small data-sets?
Anna [14]
Independent Component Analysis (ICA) is based on information-theory and is also one of the most widely used dimensionality reduction techniques.
8 0
2 years ago
_____ is a higher-level, object-oriented application interface used to access remote database servers
makkiz [27]
RDO.

RDO uses the lower-level DAO and ODBC for direct access to databases.
7 0
1 year ago
Other questions:
  • An Open Authorization (OAuth) access token would have a _____ that tells what the third party app has access to
    5·1 answer
  • Press the _______ key to move to the next cell in a row.
    12·2 answers
  • For each of these statements find a domain for which the statement is true and a domain for which the statement is false. a) Eve
    13·1 answer
  • 12. Kelly would like to know the average bonus multiplier for the employees. In cell C11, create a formula using the AVERAGE fun
    7·1 answer
  • To create a chart, you need to select at least
    8·1 answer
  • As a prospective student, what is the best reason to request an interview with your college application?
    6·1 answer
  • I need le help, darn ijourneys
    10·2 answers
  • Project introduction​
    14·1 answer
  • Match the ernerging technologies to their descriptions.
    14·1 answer
  • The LCD screens are found in​
    14·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!