Beginning Java Data Structures and Algorithms

Implementing Bubble Sort

To implement bubble sort in Java, follow these steps:

1. Apply the pseudocode shown in Snippet 2.1 in Java. Create a class and a method, accepting an array to sort as follows:

 public void sort(int[] numbers) 

2. The slightly tricky part of this algorithm is the swapping logic. This is done by assigning one of the elements to be swapped to a temporary variable, as shown in Snippet 2.2:

public void sort(int[] numbers) {  for (int i = 1; i < numbers.length; i++) {    for (int j = 0; j < numbers.length - 1; j++) {      if (numbers[j] > numbers[j + 1]) {        int temp = numbers[j];        numbers[j] = numbers[j + 1];        numbers[j + 1] = temp;      }    }  }}  

Snippet 2.2: Bubble sort solution. Source class name: BubbleSort

Go to https://goo.gl/7atHVR ...