-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathselectionSort.java
53 lines (46 loc) · 1.37 KB
/
selectionSort.java
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
import java.util.Scanner;
public class selectionSort
{
public static void main(String args[])
{
//declaration
Scanner sc = new Scanner(System.in);
int n, smallest, indexOfSmallest, temp;
int[] a;
//reading the number of array elements
System.out.println("Enter the number of array elements: ");
n = sc.nextInt();
//creating an array of size n
a = new int[n];
//reading the array elements
System.out.println("Enter " + n + " array elements");
for(int i = 0 ; i < n ; i++)
{
a[i] = sc.nextInt();
}
//selection sort techinique
for(int i = 0 ; i < n-1 ; i++)
{
//initialization
smallest = a[i] ;
indexOfSmallest = i ;
for(int j = i+1 ; j < n ; j++)
{
if(a[j] < smallest)
{
smallest = a[j];
indexOfSmallest = j ;
}
}
//swpping the array
temp = a[i];
a[i] = a[indexOfSmallest];
a[indexOfSmallest] = temp;
}
//display statement
for(int i = 0 ; i < a.length ; i++)
{
System.out.println(a[i] + " ");
}
}
}