To implement Java program using Array.

Explanation

The provided Java code demonstrates how to sort an array of integers in descending order (from largest to smallest).

The logic uses two nested for loops, a technique often referred to as an "Exchange Sort" or a variation of "Selection Sort."

1. Initialization: An integer array arr is created with five unsorted values: {5, 2, 8, 1, 9}.
2. Outer Loop: The first loop (variable i) starts at the beginning of the array. Its job is to "fix" the value for the current position i.
3. Inner Loop: The second loop (variable j) starts from the position immediately after i (i + 1) and scans the rest of the array.
4. Comparison and Swapping: Inside the inner loop, the code compares the element at index i with the element at index j. Since we want a descending order, the condition if (arr[i] < arr[j]) checks if the current element is smaller than any subsequent element. If it is, they swap places. This ensures that after the inner loop finishes one full cycle, the largest available number is moved to position i.
5. Temporary Variable: A variable named temp is used during the swap to prevent data loss. It holds the value of arr[i] while arr[j] is moved into arr[i].
6. Output: Finally, an "enhanced for-loop" (also known as a for-each loop) iterates through the modified array and prints each number to the console.

Algorithm

1. Start.
2. Initialize an integer array with a set of unsorted values.
3. Outer Loop: Iterate from i = 0 to length - 1.
4. Inner Loop: Iterate from j = i + 1 to length - 1.
5. Compare: If the element at index i is less than the element at index j:
   • Store arr[i] in a temporary variable temp.
   • Assign arr[j] to arr[i].
   • Assign temp to arr[j].
6. Repeat the inner loop until all elements following i have been compared.
7. Repeat the outer loop until the entire array is processed.
8. Display: Use a loop to traverse the sorted array and print each element.
9. End.