FilesExpand file tree

 master

/

BubbleSort.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

40 lines (38 loc) · 1.31 KB

 master

/

BubbleSort.java

Copy path

Top

File metadata and controls

• Code
• Blame

40 lines (38 loc) · 1.31 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

package sorting.algorithms;

/**

* Starting from the beginning of the list, compare every adjacent pair, swap their position if they are not in the

* right order (the latter one is smaller than the former one).

* After each iteration, one less element (the last one) is needed to be compared until there are no more elements

* left to be compared.

* If at least one swap has been done, repeat step 1.

*

* It puts biggest element at the end of the list and decreases the list size by 1, to be compared.

*

* http://www.algolist.net/Algorithms/Sorting/Bubble_sort

* http://upload.wikimedia.org/wikipedia/commons/c/c8/Bubble-sort-example-300px.gif

*

* User: rpanjrath

* Date: 8/20/13

* Time: 2:55 PM

*/

public class BubbleSort {

public int[] sort(int[] inputArray) {

int arrayLength = inputArray.length;

int j = 0;

int temp;

boolean swapped = true;

while (swapped) {

swapped = false;

j++;

for (int i = 0; i < arrayLength - j; i++) {

if (inputArray[i] > inputArray[i + 1]) {

temp = inputArray[i];

inputArray[i] = inputArray[i + 1];

inputArray[i + 1] = temp;

swapped = true;

}

}

}

return inputArray;

}

}