Java-Sort-Algorithms/SelectionSort.java at master · mattryanmtl/Java-Sort-Algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
import java.util.Scanner;


/* Class SelectionSort */

public class SelectionSort

{

    /* Selection Sort function */

    public static void sort( int arr[] ){

        int N = arr.length;

        int i, j, pos, temp;

        for (i = 0; i < N-1; i++)

        {

            pos = i;

            for (j = i+1; j < N; j++)

            {

                if (arr[j] < arr[pos])

                {

                    pos = j;

                }

            }

            /* Swap arr[i] and arr[pos] */

            temp = arr[i];

            arr[i] = arr[pos];

            arr[pos]= temp;

        }

    }

    /* Main method */

    public static void main(String[] args)

    {

        Scanner scan = new Scanner( System.in );


        System.out.println("Selection Sort Test\n");

        int n, i;

        /* Accept number of elements */

        System.out.println("Enter number of integer elements");

        n = scan.nextInt();

        /* Create integer array on n elements */

        int arr[] = new int[ n ];

        /* Accept elements */

        System.out.println("\nEnter "+ n +" integer elements");

        for (i = 0; i < n; i++)

            arr[i] = scan.nextInt();

        /* Call method sort */

        sort(arr);

        /* Print sorted Array */

        System.out.println("\nElements after sorting ");

        for (i = 0; i < n; i++)

            System.out.print(arr[i]+" ");

        System.out.println();

    }


}