Sorting array of numbers

Question

I have an multiple arrays of numbers 1-10 in different orders. I want to sort them in ascending order.
example
for(int pass=0; pass < sizeofarray; pass++){
    for(int t=0; t < sizeofarray; t++){
        if(array[t] > array[t+1]){
            hold=array[t];
            array[t] = array[t+1];
            array[t+1] = hold;
}This loops through 10 times no matter how the array is originally sorted. How do I decrease the number of times this cycles if the array is pre-sorted?
example arrays {10,9,8,7,6,5,4,3,2,1} need to go 10 times
{1,2,3,4,5,6,7,8,9,10} only needs to check it once.
Help, please only loops, no array.sort. This is a homework assignment.

Answer 1

Quicksort while effective, is not what I needed. A modified bubble sort is what I wanted. Thanks to all who posted. I found the logic I was able to modify for my needs at
http://www.autoobjects.com/Home/Teaching/CmpE_126/CmpE_126_Lectures/Sortings/sortings.html#Bubble_Sort
here's basically what it did (in C++):
    Improved Bubble Sort                                                                                                        */
void BubbleSort( UserData x[ ], int siz ){
        int i, j, switched;
        /* outer loop controls the number of pass */
        for( i = 0, switched = true; i < siz - 1 && switched == true; i++ ){
                /* initially no interchanges have been made on this pass */
                /* inner loop controls each individual pass */
                for( j = siz - 1, switched = false; j > i; j-- ){
                        if( getKey( x[ j ] ) > getKey( x[ j - 1 ] )){  /* an interchange becomes required */
                                switched = true;
                                Swap( x[ j ], x[ j - 1 ] );
                        }        /* inner loop */
                }       /* outer loop */
        return;
        }Thanks to jbish who had the most useful answer for my needs.