help me please, my life is on the line !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!?

Question

I got this exercise for homework, but i have no clue how to do it... PLEASE HELP ME !, thanks for all answers!

Write a C++ program that finds the position of the smallest and largest number in an array of double. Use a function

void slposition (double[ ] array, int& psmallest, int size)

to do it. Here the size is the size of the array. Thanks for all the help i can get !. Yes it is my homework, i tried but dont know how to do it... HELP ME !!!!!!!

Answer 1

http://answers.yahoo.com/question/index;_ylt=Ajb3c2BglE.CADpaNtV.XTty7hR.?qid=20070208035926AA2DR4B

Answer 2

Go through the array. Have two variables.
double smallest = MAX_DOUBLE_VALUE; //Get this from the limits.h include file. I'm not sure if that's the exact way to do it, but that's it.
double largest = MIN_DOUBLE_VALUE; //Same as for MAX.

The reason you do the min and the max for the opposite variables is that you are guaranteed to change them then, no matter the number range.

int lcv = 0;
int position_smallest;
int position_largest;

int array_length = sizeof(array) / sizeof(array[0];

for( ; lcv < array_length; lcv++)
{
if(array[lcv] < smallest)
{
smallest = array[lcv];
position_smallest = lcv;
}
if(array[lcv] > largest)
{
largest = array[lcv];
position_largest = lcv;
}
}

There you go, now your two variables position_smallest and position_largest have the positions of the numbers you are looking for.

Hope it helps! If you have any more questions about the code, I'd be more than happy to help.

Answer 3

Your life is NOT on the line. The problem here is that you've been too lazy to do your own homework, and now you want someone else to do it for you otherwise you'll get in trouble. Why not either:

a) Take it like a man
or
b) Get your *** in gear and learn to code

instead of lying to the people you are asking for help.

Answer 4

#include
using namespace std;

void slposition (double b[], int size)
{
int i;
double small=b[0];
double big=b[0];
int smallindex=0;
int bigindex=0;
for(i=1;i if (small > min(small,b[i])) smallindex=i;
if (big < max(big,b[i])) bigindex=i;
}
cout << "\n position of the smallest : " << smallindex;
cout << "\n position of the largest : " << bigindex;
return;
}

main () {
double a[10];
int n,i;

while(true){

system("cls");
cout << "\nEnter number of the elements :";
cin >> n;
for(i=0;i cout << "\nEnter element " << i << " : ";
cin >> a[i];
}
slposition (a,n);
cout << endl << endl;
system("pause");
}
}

Answer 5

MAX=-1;
MIN=9999;
for(int i+0; i {
if (array[i]>max)
max=array[i];
locationmax = i;
if (array[i] min=array[i];
locationmin = i;
}
implement this this should help.

Answer 6

we dont solve exercise work here. what is the specific problem that u are facing in programjming

Answer 7

Cheating on life eh?

Answer 8

Is your life really on the line?

Answer 9

cheater!