To implement Java program using Array.

Explanation

This Java program implements the Bubble Sort algorithm, which is one of the simplest sorting techniques used to arrange elements in a specific order (ascending in this case).

The core logic revolves around comparing adjacent elements in an array. If the element on the left is greater than the element on the right, they are swapped. This process is repeated for every pair of elements. In each complete pass through the array, the largest unsorted element "bubbles up" to its correct position at the end of the array.

The code includes an optimization: a boolean flag called swapped. If the program completes a full pass through the array without making a single swap, it means the array is already sorted, and the program breaks out of the loop early to save processing time.

Algorithm

1. Initialize an integer array arr with unsorted values.
2. Set up an outer loop that runs from the start of the array to the second-to-last element ($n-1$ times).
3. Initialize a boolean flag swapped to false at the start of each outer loop iteration.
4. Set up an inner loop to compare adjacent elements (arr[j] and arr[j+1]).
   • The range of this loop decreases by i in each pass because the largest elements are already placed at the end.
5. Compare elements: If arr[j] > arr[j+1], perform a swap:
   • Store arr[j] in a temporary variable.
   • Assign arr[j+1] to arr[j].
   • Assign the temporary variable to arr[j+1].
   • Set swapped to true.
6. Check for optimization: After the inner loop, if swapped is still false, the array is sorted; break the outer loop.
7. Print the final sorted array using an enhanced for-loop.