FilesExpand file tree

 master

/

BubbleSort.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

70 lines (62 loc) · 1.67 KB

 master

/

BubbleSort.java

Copy path

Top

File metadata and controls

• Code
• Blame

70 lines (62 loc) · 1.67 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

/**

*

* @author Varun Upadhyay (https://github.com/varunu28)

*

*/

class BubbleSort

{

/**

* This method implements the Generic Bubble Sort

*

* @param array The array to be sorted

* @param last The count of total number of elements in array

* Sorts the array in increasing order

**/

public static <T extends Comparable<T>> void BS(T array[], int last) {

//Sorting

boolean swap;

do

{

swap = false;

for (int count = 0; count < last-1; count++)

{

int comp = array[count].compareTo(array[count + 1]);

if (comp > 0)

{

T temp = array[count];

array[count] = array[count + 1];

array[count + 1] = temp;

swap = true;

}

}

last--;

} while (swap);

}

// Driver Program

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.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");

}

}

}