array[] problem

[yusiye]

The question asks to take the following list{12,31, 43, 23,25, 78, 200, 109, 345, 5, 188} into an integer array, and let the program find the smallest, median, and largest value and print them out.
This is what i done so far

#include<stdio.h>
#define MAX 11

int array[MAX] = {12,31, 43, 23,25, 78, 200, 109, 345, 5, 188};
int largest(int array[]);

void main() 
{
      printf("the largest is : %d\n", largest(array);
}

int largest(int array[])
{

My profesoor told me to use

Bsort, list 

, but i don't know where to put them, so can anybody help, thx

[quzah]

Well at least you started. Ok, so what do you do next? How would you go about finding what one is the largest?

Do you know what a loop is? How about using one to run through the list? Read each value and compare it with whatever value you have stored in a temp value. If the one you're comparing is bigger, put it in the temp valud.

When you're done with the loop, the temp value will hold the biggest value.

The same goes for the smallest.

Quzah.

[gabulldog]

Finally, for the median, you might think about a function that sorts the array, then find the middle of the array for your median number.

Have fun.

[moonwalker]

I don't know what you mean by Bsort... Bubble sort ?

Bubble sort is one of the quickest way to arrange the numbers in ascending/descending orders...

here's a simple bubble sort program:

#include <stdio.h>

main()
{
    int a[10] = {1,2,3,4,5,6,7,8,9,10};
    int i,c,j;
    
    for (j=0; j<=8;j++){
    for (i=0;i<=8; i++){
        if (a[i]<a[i+1]){
        c=a[i];
        a[i]=a[i+1];
        a[i+1]=c;
        }
    }
}
    for (i=0; i<=9; i++){
    printf("a[%d]=%d\n",i, a[i]);
    }
} 

If bubble sort is what you're looking for, you can change this program to fit your needs.

[Hammer]

>Bubble sort is one of the quickest way to arrange the numbers in ascending/descending orders...
It is certainly not the quickest, in fact for sorting large array, its probably one of the slowest. But for small arrays the programmer probably won't notice too much time delay.

There's a good demo here for sorting algorithms.

[Prelude]

>Bubble sort is one of the quickest way to arrange the numbers in ascending/descending orders...
That's a good one. Bubble sort is probably the least efficient sorting method in existance next to bogo-sort. But I do have to admit that anything below about 5000 elements is technically okay using bubble sort (though you don't want to use it in the real world). There are certainly faster and easier to understand methods which don't suffer quite as much under a realistic stress test.

>But for small arrays the programmer probably won't notice too much time delay.
Have you ever sorted a small array that remained small outside of a classroom?

-Prelude

[Hammer]

>Have you ever sorted a small array that remained small outside of a classroom?
Yes! But I know where your coming from..