No, if something gone wrong with memory (overflow, bad access, derefernce 0 after mallocing 0 if you out of memory), kernel sends SIGSEGV signal (means segmentation fault) to you, and then your program goto your signal handler, or to default handler (which quits you program and type "seg fault" message) if you didn't register any.

My Lord... What is this ?

write a program that wll take in 9 numbers and then employ a search platform that wll search numbers frm the array. If a number has nt been found, The program wll print "Number does nt exist in array" and continue to loop otherwise there is a match the program wll print "Match found" and then terminate. ... Help guys just need a skeleton of this code. ...

write a program that wll take in 9 numbers and then employ a search platform that wll search numbers frm the array. If a number has nt been found, The program wll print "Number does nt exist in array" and continue to loop otherwise there is a match the program wll print "Match found" and then terminate. ... Help guys just need a skeleton of this code. ...

I'm too tired to argue with you https://github.com/Sid-Sun/cLabProhgrams/blob/master/binarySearch.c

Thanks man ,a lot but i wanted c ++

You can figure out how to do that, you wanted a "skeleton code" anyway

Or just malloc (8gb) ?

Welcome Angelo

What are the errors we can prevent using function prototype I couldnt get answer in google and books too so help please

Is default keyword and drfault statement used in switch same?

Given an array of n positive integers, for all i except when i= t, A[i]=i, and A[t]=t+1;find the value of t. (Not using brute force approach i.e O(n) ). Example Let 8 be the number of integers in an array so and let t=6 so array will be {0,1,2,3,4,5,7,7} . Now how to find t using binary search. I am confused plz help or tell me the approach

What are the ASCII values of Up/Down/Left/Right Arrow keys???

#include <iostream> #include <vector> using namespace std; int main() { int n,ele; cin>>n; vector<int> array; for(int i=0;i<n;i++) { cin>>ele; array.push_back(ele); } for(int i=0;i<n;i++) { cout<<array[i]<<" "; } vector<int> a; vector<int> b; vector<int> c; vector<int> d; int j=0; while(j<n) { while(array[j]>=0) { a.push_back(array[j]); j++; } while(array[j]<0) { b.push_back(array[j]); j++; } while(array[j]>=0) { c.push_back(array[j]); j++; } while(array[j]<0) { d.push_back(array[j]); j++; } } return 0; }

i want to break an array into 4 parts such that the positive and negative elements are stored in different arrays... say -2 -3 4 0 -3 -4 5 6 7 should be stored as [-2 -3] [4 0] [-3 -4] [5 6 7]

write a program that wll take in 9 numbers and then employ a search platform that wll search numbers frm the array. If a number has nt been found, The program wll print "Number does nt exist in array" and continue to loop otherwise there is a match the program wll print "Match found" and then terminate. ... Help guys just need a skeleton of this code. ...

Did you manage to solve this or still have a problem?

Still problem😕

Isn't your problem similar to finding a repeated number in consecutive n integers ?

Is that your problem statement? It doesn't sound generic.

Why have you kept 4 vectors?

Because I have to divide it into four sub arrays and find their sums later ._.

Say you make four sub arrays A,B,C,D they want them to be made such that sumA+sumC-sumB-sumD is minimum. That was the question. And A,B,C,D should have numbers in the same order as the original array.. that is if you concatenate them you get the array back

Anyhow, even when all numbers are positive, the value will be maximum when subarrays B and D are empty, right?

True... But I was wondering why my code gives segmentation fault

Can anyone tell me how to increase array size during runtime??

yes, but you want minimum..right?

did you try gdb through your code?

Or can you send me any link where it is explained in detail??