HIDE NAV

Introduction to Sorting Arrays

This Java program demonstrates basic tasks in array sorting such as swapping entries, printing the array and finding the smallest value.

Main.java


package ceccs;

public class Main {

    public static void main(String[] args) {
        /** Create an array to sort */
        final int dataSize = 10;
        double[] data = new double[dataSize];
        for (int i = 0; i < data.length; i++) {
            data[i] = Math.random() * 100.0;
        }
        System.out.println("Original Data");
        printData(data);

        /** swapping two values in an array - use a temp var*/
        double temp = data[4];
        data[4] = data[7];
        data[7] = temp;
        System.out.println("swap pos. [4] and [7]");
        printData(data);

        /**finding a minimum */
        double smallest = data[0];
        int smIndex = 0;
        for(int i = 0; i < data.length; i++){
            if(data[i] < smallest) {
                smallest = data[i];
                smIndex = i;
            }
        }
        String smallestString = String.format("The smallest value, %4.1f is at [%d]", smallest, smIndex);
        System.out.println(smallestString);

    }

    static void printData(double[] array){
        
        String out = new String();
        for(int i = 0; i < array.length; i++){
            String s = String.format("[%d]=  %4.1f\n", i, array[i]);
            out += s;
        }
        out += "\n";
        System.out.println(out);
        
    }
}