forked from karterhhgg/JavaProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSelectionSorting.java
More file actions
53 lines (47 loc) · 1.49 KB
/
SelectionSorting.java
File metadata and controls
53 lines (47 loc) · 1.49 KB
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
package Sorting;
import java.util.*;
public class SelectionSorting {
//Time Complexity of Selection Sort = O(n^2)
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print("Enter the Size of the Array: ");
int size = sc.nextInt();
int array[] = new int[size];
//for input
System.out.print("Enter the array element: ");
for(int i=0; i<size; i++){
array[i] = sc.nextInt();
}
//for output
System.out.print("Print the array element: ");
for(int i=0; i<size; i++){
System.out.print(" "+ array[i]);
}
System.out.println();
// Selection Sort
System.out.println("Sorted array element using Selection Sorting: ");
for(int i=0; i<array.length-1; i++){
int smallest = i;
for(int j=i+1; j<array.length; j++){
if(array[smallest] > array[j]){
smallest = j;
}
}
// swap the element
int temp = array[smallest];
array[smallest] = array[i];
array[i] = temp;
}
for(int i=0; i<size; i++){
System.out.print(array[i]+" ");
}
}
}
//output
/*
Enter the Size of the Array: 5
Enter the array element: 5 9 2 1 4
Print the array element: 5 9 2 1 4
Sorted array element using Selection Sorting:
1 2 4 5 9
*/