Sorting an array of integers into ascending order

Question

Today I decided to blow the cobwebs off my old laptop and see what I could remember from my Java days.
As a task for myself to see what I could remember, I decided to try and write a program that does the following:
- Declares an array of 4 integers
- Sorts the array into ascending order, from lowest to highest.
- Prints on screen the sorted array.
After an hour or so I finally cracked it, and ended up with a working program. Here she is:
public class Sorting_arrays_1
    public static void main()
       int [] array = {4,3,7,1};
       //A variable used to help with swopping values
       int temporary;
          //finds the smallest number out of elements 0, 1, 2, and 3 of the array, then moves it to position 0
          for (int count = 0; count<array.length;count++)
            int smallestNumber = array[0];
            if (array[count] < smallestNumber)
                smallestNumber = array[count];
                temporary = array[0];
                array[0]=array[count];
                array[count]=temporary;
         //finds the smallest number out of elements 1, 2, and 3 of the array, then moves it to position 1
         for (int count = 1; count<array.length;count++)
            int smallestNumber = array[1];
            if (array[count] < smallestNumber)
                smallestNumber = array[count];
                temporary = array[1];
                array[1]=array[count];
                array[count]=temporary;        
          //finds the smallest number out of elements 2 and 3 of the array, then moves it to position 2
          for (int count = 2; count<array.length;count++)
            int smallestNumber=array[2];
            if (array[count] < smallestNumber)
                smallestNumber = array[count];
                temporary = array[2];
                array[2]=array[count];
                array[count]=temporary;     
         //prints the array in ascending order
         for (int count=0; count<array.length;count++)
             System.out.print(array[count] + " ");
}Could this code be simplified though? Maybe with a for loop?
I mean, it does the job, but it looks so clumbsy and inefficient... Imagine how much code I would need if I wanted to sort 1000 numbers..

Answer 1

Use bubble sort if u want a quick fix
public static void bubbleSort(int [] a)
for(int i=0; i<a.length-1; i++)
     for(int j=0; j<a.length-1-i; j++)
          if(a[j]>a[j+1])
               int temp = a[j];
               a[j]=a[j+1];
               a[j+1]=temp;
Or use Merge sort if u want better run time... ie.(N log N)