-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtest.java
52 lines (47 loc) · 1.33 KB
/
test.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
import java.util.Scanner;
public class test {
int size;
int[] arr;
public int[] bubbleSort(int[] arr) {
for (int i = 0; i < this.size - 1; i++) {
for (int j = 0; j < size - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
return arr;
}
public void bubble_recursive(int[] arr, int size) {
if (size == 1) {
return;
}
for (int i = 0; i < size - 1; i++) {
if (arr[i] > arr[i + 1]) {
int temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
}
}
bubble_recursive(arr, size - 1);
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
test t = new test();
t.size = sc.nextInt();
t.arr = new int[t.size];
for (int i = 0; i < t.size; i++) {
t.arr[i] = sc.nextInt();
}
sc.close();
t.bubble_recursive(t.arr, t.size);
System.out.println();
for (int i = 0; i < t.size; i++) {
System.out.print(t.arr[i]);
System.out.print(",");
}
System.out.println();
}
}