Organizing an Array

[dmoore210]

How would you go about *most efficiently* organizing an int array from smallest to largest number. Here's a quick example code, has no error checking and is very literal, just used for an example.

#include <iostream>

using namespace std;

int main()
{
    int ary[20];
    int x;

    for( x = 0; x <= 20; x++ )
    {
        printf( "%d: ", x );
        cin >> ary[x];
    }

    for ( x = 0; x <= 20; x++ )
      cout << ary[x] << endl;

    /* Organizing Code Here */
    cin >> x;
}

[helios]

Pfft. Done it a thousand times.

void qsort(int *array,int beg,in...

Wait a second.

How would you go about *most efficiently* organizing an int array from smallest to largest number. Here's a quick example code, has no error checking and is very literal, just used for an example.

I don't believe you. This seems like a cleverly disguised homework question.
You post the first example.

[Bazzy]

How would you go about *most efficiently* organizing an int array from smallest to largest number

I wouldn't go to the *most efficient* way but for the *less typing* with already made STL algorithms