Yes solve it

some exam in india?

Ah i see

which institute?

Plz solve and upload 😥

why should i ? its not my assigment :D

It's just a fascinating number program Plz do help for us

PSG college Coimbatore

Yes solve it

C program for fascinating number

Anyone give me competitive programs to practice in c and c++

I've used free() nowhere in the program

sigh...

#include<iostream> #include<chrono> #include<random> #include<cstdlib> #include<vector> #include<fstream> #include<stdint.h> using namespace std; using namespace std::chrono; int found=0; int notfound; double ltimex = 0; double lavgtime = 0; double btimex = 0; double bavgtime = 0; int pos; int partition(vector<int>a, int first, int last){ //partition algo for quick sort int pivot = a[last]; int pi = a[first]; for(int i = first; i<=last-1; i++){ if(a[i]<pivot){ swap(a[i], a[pi]); pi++; } swap(a[last], a[pi]); } return pi; } int quicksort(vector<int>a, int first, int last){ //function for quick sort if(first<last){ //break statement for recursive call. int pi=partition(a, first, last); //pi=partioning index quicksort(a,first, pi-1); quicksort(a, pi+1, last); } } int linearsearch(vector<int> a, int key){ //linear search int pos,j; for(j=1; j<a.size(); j++){ if(key==a[j]){ pos = j; found++; break; } } if(pos == j){ return pos; } else { notfound = -1; return notfound; } } int binarysearch(vector<int>a, int fst, int lst, int key){ int mid = fst+lst/2; if(key==a[mid]) return mid; if (key>a[mid]){ binarysearch(a,mid+1, lst, key); } binarysearch(a, fst, mid-1, key); } int main(){ int i,j,l; srand(time(0)); for(i=5000; i<=50000; i=i+5000){ vector<int>a; for(j=0; j<100; j++){ //loop for test case, 100 for(int k=1; k<=i-1; k++){ int z = rand()%i+100; a.push_back(z); } int key = rand()%i+100; //sorting of the array. quicksort(a, 0, i); //quick sort function call //time functions. //linear search auto start = high_resolution_clock::now(); linearsearch(a,key); auto stop = high_resolution_clock::now(); ltimex = duration_cast<microseconds>(stop - start).count(); lavgtime = lavgtime + ltimex; //binary search auto bstart = high_resolution_clock::now(); binarysearch(a,0,i,key); auto bstop = high_resolution_clock::now(); btimex = duration_cast<microseconds>(bstop - bstart).count(); bavgtime = bavgtime + btimex; } cout << "\nAverage Time taken by linear function: "<< lavgtime << " microseconds"; cout << "\nAverage Time taken by binary function: "<< bavgtime << " microseconds"; ofstream fout; fout.open("data.csv", ios::out | ios::app); while (fout) { if (pos != -1) fout<<i<<","<<lavgtime<<","<<bavgtime<<"\n"; break; } fout.close(); } return 0; }

free(): invalid next size(normal) Aborted (core dumped)

now I am receiving "segmentation fault" 😂😅 I'll try fixing this on my own

instead of this: int mid = fst+lst/2; you should use this: int mid = fst+(lst-fst)/2;

I know 😎 I'm a relatively high ranked coder in Google CodeJam, Code Forces, and Top Coders

wow really?

not red, but yellow

hey dimka why is stdlib.h retarded

/nix/store/fj6rjsjnl08p57gh7dms3njgniiw3fxq-gcc-9.2.0/include/c++/9.2.0/cmath:45:15: fatal error: math.h: No such file or directory 45 | #include_next <math.h>

hello . can you answer this question? why 0!=1

https://www.youtube.com/watch?v=W2sIvBq2iAk

ok and why any number Divided zero Equals Unknown for Ex 1÷0= Unknown??

ok and why any number Divided zero Equals Unknown for Ex 1÷0= Unknown??