-
Notifications
You must be signed in to change notification settings - Fork 0
/
Sorting.java
63 lines (51 loc) · 1.33 KB
/
Sorting.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
54
55
56
57
58
59
60
61
62
63
import java.util.Scanner;
public class Sorting {
public static void main(String[] args) {
int []A = {2, 5, 1, 2, 3, 4, 3};
SortingAlgorithms sa = new SortingAlgorithms(A);
sa.printArray();
sa.bubbleSort();
sa.printArray();
}
}
class SortingAlgorithms{
int []arr;
SortingAlgorithms(int []newArr){
arr = newArr.clone();
// System.out.println("arr is " + arr + " newArr is " + newArr);
}
public void printArray(){
System.out.println("Array elements are:");
for(int x: arr){
System.out.print(x + " ");
}
System.out.println("");
}
private void swap(int i, int j){
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
public void selectionSort(){
int n = arr.length;
for(int i=0;i<n-1;i++){
int minIndex = i;
for(int j=i+1;j<n;j++){
if(arr[j] < arr[minIndex]){
minIndex = j;
}
}
swap(i, minIndex);
}
}
public void bubbleSort(){
int n = arr.length;
for(int i=1;i<n-1;i++){
for(int j=0;j<(n-i);j++){
if(arr[j] > arr[j+1]){
swap(j, j+1);
}
}
}
}
}