51 lines
1.3 KiB
Java
51 lines
1.3 KiB
Java
package Sorts;
|
|
|
|
import static Sorts.SortUtils.*;
|
|
|
|
/**
|
|
* @author Varun Upadhyay (https://github.com/varunu28)
|
|
* @author Podshivalov Nikita (https://github.com/nikitap492)
|
|
* @see SortAlgorithm
|
|
*/
|
|
|
|
class BubbleSort implements SortAlgorithm {
|
|
/**
|
|
* This method implements the Generic Bubble Sort
|
|
*
|
|
* @param array The array to be sorted
|
|
* Sorts the array in increasing order
|
|
**/
|
|
|
|
@Override
|
|
public <T extends Comparable<T>> T[] sort(T array[]) {
|
|
for (int i = 0, size = array.length; i < size - 1; ++i) {
|
|
boolean swapped = false;
|
|
for (int j = 0; j < size - 1 - i; ++j) {
|
|
swapped = less(array[j], array[j + 1]) && swap(array, j, j + 1);
|
|
}
|
|
if (!swapped) {
|
|
break;
|
|
}
|
|
}
|
|
return array;
|
|
}
|
|
|
|
// Driver Program
|
|
public static void main(String[] args) {
|
|
|
|
// Integer Input
|
|
Integer[] integers = {4, 23, 6, 78, 1, 54, 231, 9, 12};
|
|
BubbleSort bubbleSort = new BubbleSort();
|
|
bubbleSort.sort(integers);
|
|
|
|
// Output => 231, 78, 54, 23, 12, 9, 6, 4, 1
|
|
print(integers);
|
|
|
|
// String Input
|
|
String[] strings = {"c", "a", "e", "b", "d"};
|
|
//Output => e, d, c, b, a
|
|
print(bubbleSort.sort(strings));
|
|
|
|
}
|
|
}
|