forked from NITSkmOS/Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbubble_sort.java
40 lines (36 loc) · 1.27 KB
/
bubble_sort.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
public class bubble_sort {
public static void main(String[] args){
//Taking a sample array for sorting it.
int[] nums = {12, 45, 23, 78, 67};
//calling the method and passing the array in it.
bubble(nums, nums.length);
//Printing the sorted array
print_sorted_array(nums);
}
//The recurisve method that takes in the array and the length of it.
public static void bubble(int[] nums, int end){
//base case
if (end == 1) {
return;
}
//for loop that iterates and sorts the sorts the array
for (int i = 0; i < end - 1; i++) {
if (nums[i] > nums[i + 1]) {
int temp = nums[i];
nums[i] = nums[i + 1];
nums[i + 1] = temp;
}
}
//calling the method again to sort the rest of the elements on next iteration
bubble(nums, end - 1);
}
//Method to print an array
public static void print_sorted_array(int arr[]) {
//storing the length of an array using the .length function in Java
int n = arr.length;
//For loop that iterates over each element of the array and then prints it.
for (int i = 0; i < n; ++i)
System.out.print(arr[i] + " ");
System.out.println();
}
}