Merge pull request #83 from varunu28/master

Updated BubbleSort.java
This commit is contained in:
Anup Kumar Panwar
2017-08-19 20:21:52 +05:30
committed by GitHub

View File

@ -1,58 +1,70 @@
import java.util.Scanner;
/** /**
* This class implements BubbleSort
* *
* @author Unknown * @author Varun Upadhyay (https://github.com/varunu28)
* *
*/ */
class BubbleSort class BubbleSort
{ {
/** /**
* Main Method * This method implements the Generic Bubble Sort
* *
* @param args Command line arguments * @param array The array to make the binary search
*/ * @param last The count of total number of elements in array
public static void main(String[] args) * Sorts the array in increasing order
{ **/
int size = 6;
int array[]=new int[size];
boolean swap;
int last = size - 1;
Scanner input=new Scanner(System.in);
//Input
System.out.println("Enter any 6 Numbers for Unsorted Array : ");
for(int i=0; i<6; i++)
{
array[i]=input.nextInt();
}
public static <T extends Comparable<T>> void BS(T array[], int last) {
//Sorting //Sorting
boolean swap;
do do
{ {
swap = false; swap = false;
for (int count = 0; count < last; count++) for (int count = 0; count < last-1; count++)
{ {
if (array[count] > array[count + 1]) int comp = array[count].compareTo(array[count + 1]);
if (comp > 0)
{ {
int temp = array[count]; T temp = array[count];
array[count] = array[count + 1]; array[count] = array[count + 1];
array[count + 1] = temp; array[count + 1] = temp;
swap = true; swap = true;
} }
} }
last--; last--;
} while (swap); } while (swap);
}
//Output // Driver Program
for(int i=0; i<6; i++) public static void main(String[] args)
{
// Integer Input
int[] arr1 = {4,23,6,78,1,54,231,9,12};
int last = arr1.length;
Integer[] array = new Integer[last];
for (int i=0;i<last;i++) {
array[i] = arr1[i];
}
BS(array, last);
// Output => 1 4 6 9 12 23 54 78 231
for(int i=0; i<last; i++)
{ {
System.out.print(array[i]+"\t"); System.out.print(array[i]+"\t");
} }
input.close(); System.out.println();
// String Input
String[] array1 = {"c", "a", "e", "b","d"};
last = array1.length;
BS(array1, last);
//Output => a b c d e
for(int i=0; i<last; i++)
{
System.out.print(array1[i]+"\t");
}
} }
} }