Implement a BubbleSort to Ascending order.Initialize Array of A and B of M and N. Sort it Join the Elements Consecutively.
class BubbleSort {
public static void main(String[] args) {
BubbleSort a = new BubbleSort();
int[] A = { 1, 2, 4, 3, 6 };
int[] B = { 312, 11, 45, 67, -4, 43 };
A = a.sort(A);
System.out.println("Sorted A :");
a.display_arr(A);
B = a.sort(B);
System.out.println("Sorted B :");
a.display_arr(B);
System.out.println("Merged Array :");
a.display_arr(a.merge_array(A, B));
}
int[] sort(int[] arr) {
boolean sorted = false;
for (int x = 0; !sorted && x < arr.length - 1; x++) {
sorted = true;
for (int y = 0; y < arr.length - x - 1; y++) {
if (arr[y] > arr[y + 1]) {
int tmp = arr[y];
arr[y] = arr[y + 1];
arr[y + 1] = tmp;
sorted = false;
}
}
}
return arr;
}
int[] merge_array(int[] A, int[] B) {
int[] arr = new int[A.length + B.length];
int i = 0, max = Math.max(A.length, B.length);
for (int x = 0; x < max; x++) {
if (x < A.length)
arr[i++] = A[x];
if (x < B.length)
arr[i++] = B[x];
}
return arr;
}
void display_arr(int[] arr) {
for (int x = 0; x < arr.length; x++) {
System.out.print(arr[x] + "\t");
}
System.out.println();
}
}