FileDocCategorySizeDatePackage
SortNumbers.javaAPI DocExample2078Sat Jan 24 10:44:24 GMT 2004je3.basics

SortNumbers

public class SortNumbers extends Object
This class demonstrates how to sort numbers using a simple algorithm

Fields Summary
Constructors Summary
Methods Summary
public static voidmain(java.lang.String[] args)
This is a simple test program for the algorithm above

        double[] nums = new double[10];      // Create an array to hold numbers
        for(int i = 0; i < nums.length; i++) // Generate random numbers
            nums[i] = Math.random() * 100;
        sort(nums);                          // Sort them
        for(int i = 0; i < nums.length; i++) // Print them out
            System.out.println(nums[i]);
public static voidsort(double[] nums)
This is a very simple sorting algorithm that is not very efficient when sorting large numbers of things

        // Loop through each element of the array, sorting as we go.
        // Each time through, find the smallest remaining element, and move it
        // to the first unsorted position in the array.
        for(int i = 0; i < nums.length; i++) {
            int min = i;  // holds the index of the smallest element
            // find the smallest one between i and the end of the array
            for(int j = i; j < nums.length; j++) {
                if (nums[j] < nums[min]) min = j;
            }
            // Now swap the smallest one with element i.  
            // This leaves all elements between 0 and i sorted.
            double tmp;
            tmp = nums[i];
            nums[i] = nums[min];
            nums[min] = tmp;
        }