Selection sort an int array - Java Data Structure

Java examples for Data Structure:Sort

  1. HOME
  2. Java
  3. Data Structure
  4. Sort

Description

Selection sort an int array

Demo Code

public class Main {
    static int nboperations;

    static boolean GreaterThan(int a, int b) {
        nboperations++;//  w  ww  .j  a v  a 2 s  .com
        return (a > b);
    }

    static void swap(int[] array, int i, int j) {
        nboperations++;
        int tmp = array[i];
        array[i] = array[j];
        array[j] = tmp;
    }

    static void SelectionSort(int[] array) {
        int n = array.length;

        for (int i = 0; i < n - 1; i++) {
            for (int j = i + 1; j < n; j++) {
                if (GreaterThan(array[i], array[j]))
                    swap(array, i, j);
            }
        }
    }

    public static void main(String[] args) {
        int[] array = {16, 15, 114, 13, 12, 11, 1110, 91, 8, 7, 6, 51, 4, 3, 2, 1};
        nboperations = 0;

        SelectionSort(array);

        for (int i = 0; i < array.length; i++)
            System.out.print(array[i] + " ");
        System.out.println("");

        System.out.println("Number of operations:" + nboperations);
        int nb = 2 * array.length * (array.length - 1) / 2;
        System.out.println("Number of operations:" + nb);
    }


}

Result


Related Tutorials