Homework Help Question & Answers

graph binary search for size and time c++ //System Libraries #include <iostream> #include <string> #include <cstdlib> #include <ctime> #include <iomanip> #include <alg...

graph binary search for size and time


//System Libraries
#include <iostream>
#include <string>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <algorithm>
using namespace std;
//User Libraries

//Global Constants, no Global Variables are allowed

//Math/Physics/Conversions/Higher Dimensions - i.e. PI, e, etc...

//Function Prototypes

//Execution Begins Here!
int main(int argc, char** argv) {
int n, i, arr[50], search, first, last, middle,count=0,count_in,tot;
clock_t start, end;
float duration;
cout<<"Enter total number of elements :";
cout<<"Enter numbers";
for (i=0; i<n;i++)
cout<<"Enter a number to find :";
first = 0;
last = n-1;
start = clock();
middle = (first+last)/2;
while (first <= last)
if(arr[middle] < search)
first = middle + 1;
else if(arr[middle] == search)
last = middle - 1;
middle = (first + last)/2;
if(first > last)
cout<<"Not found! ";
tot = count_in+ count;
cout<<"Outer Operations = "<<count<<endl;
cout<<"i loop Operations = "<<count_in<<endl;
cout<<"Total Number of ops = "<<tot<<endl;
// Calculate duration
duration = (float)(end - start)/ CLOCKS_PER_SEC;
cout<<"Execution time ="<<duration<<endl;
end = clock();
return 0;

0 0
Next > < Previous
ReportAnswer #1

Run time

Above graph is log n graph

For given n algorithm take log n time

So time complexity of algorithm is O(log n)

Add Homework Help Answer
Add Answer of:
graph binary search for size and time c++ //System Libraries #include <iostream> #include <string> #include <cstdlib> #include <ctime> #include <iomanip> #include <alg...
Your Answer: Your Name: What's your source?
Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
More Homework Help Questions Additional questions in this topic.
Need Online Homework Help?
Ask a Question
Get FREE Expert Answers
Related Questions