Question

Qi. Create a java project Question that includes: • A bubble sort method to sort your arrays. Implement the below recursive binary search. • A java main class where you: o Create an array of characters that contains the letters of your first name followed by your last name, without spaces. o Call the sorting method to sort the array o Call binary search method to find the position of the first letter 'a' in your array. // Recursive Binary Search // initially called with low = 0, high = N-1, N is the array size = array length int RecursiveBS array, value, low, high) { if (high > low) { mid = (low + high)/2 if (A[mid] > value) return Recursives (array, value, low, mid-1) else if (A[mid] < value) return Resursivebs (array, value, mid+1, high) else return mid } // end of if return not found //bubbleSort method bubbleSort(char[] array) { boolean swapped = true; int j = 0 int topi while (swapped) swapped = false; for (int i = 0; į<array length-1; ++) { if (arrayli > array[i+1]) { 008 = arraylik: array[i] = array[i+1]; arravi + 1] = tme: swapped = true; } // end for H// end while

Answer 1

  import java.io.*; class Question1 {   public static void bubble_sort(char[] a){ int size = a.length; for(int i=0;i<size-1;i++){ for(int j=i+1;j<size;j++){ if(a[i]>a[j]){ char temp; temp = a[i]; a[i] = a[j]; a[j] = temp; } } } } public static int bin_search(char[] a,char value,int left,int right){ if(left>right) return -1; int mid = (left+right)/2; if(a[mid] == value) return mid; else if(value > a[mid]) return bin_search(a,value,mid+1,right); else return bin_search(a,value,left,mid-1); } public static void main(String[] args){ char[] a = {'b','c','d','a','e'}; bubble_sort(a); char value = 'c'; for(char c:a) System.out.println(c); int x = bin_search(a,value,0,a.length-1); System.out.println("element found "+x); } } 

The question is answered as per the requirement given.

Feel free to ask query if found stuck at any moment.

Thank you :) .....

U can organize it as in the screen shot.

import java.io.*:| class GFG { public static void bubble_sort(char[] a){ int size = a.length; for(int i=0;i< size-1; i++) { for(int j=i+1;j<size; j++){ if(a[i]>a[j]){ char temp; temp = a[i]; a[i] = a[j]; a[j] = temp; public static int bin_search(char[] a,char value, int left, int right) { if(left>right) return -1; int mid = (left+right)/2; if(a[mid] == value) return mid; else if(value > a[mid]) return bin_search(a,value, mid+1, right); else return bin_search(a, value, left, mid-1);

public static void main(String[] args) { char[] a = {'b','c','d', 'a', 'e'}; bubble_sort(a); char value = 'c'; for(char c:a) System.out.println(); int x = bin_search(a, value, 0, a. length-1); System.out.println("element found "+x);