Java Program to sort the elements of an array in ascending order

In this program, we need to sort the given array in ascending order such that elements will be arranged from smallest to largest. This can be achieved through two loops. The outer loop will select an element, and inner loop allows us to compare selected element with rest of the elements.

Elements will be sorted in such a way that the smallest element will appear on extreme left which in this case is 1. The largest element will appear on extreme right which in this case is 8.

Algorithm

• STEP 1: START
• STEP 2: INITIALIZE arr[] ={5, 2, 8, 7, 1 }.
• STEP 3: SET temp =0
• STEP 4: PRINT "Elements of Original Array"
• STEP 5: REPEAT STEP 6 UNTIL i<arr.length
              //for(i=0; i<arr.length; i++)
• STEP 6: PRINT arr[i]
• STEP 7: REPEAT STEP 8 to STEP 9 UNTIL i<arr.length
              //for(i=0; i<arr.length; i++ )
• STEP 8: REPEAT STEP 9 UNTIL j<arr.length
              //for(j=i+1;j<arr.length;j++)
• STEP 9: if(arr[i]>arr[j]) then
              temp = arr[i]
              arr[i]=arr[j]
              arr[j]=temp
• STEP 10: PRINT new line
• STEP 11: PRINT "Elements of array sorted in ascending order"
• STEP 12: REPEAT STEP 13 UNTIL i<arr.length
              //for(i=0;i<arr.length;i++)
• STEP 13: PRINT arr[i]
• STEP 14: END

Program:

Output:

Elements of original array:
5 2 8 7 1
Elements of array sorted in ascending order:
1 2 5 7 8    

Java Program to sort the elements of an array in ascending order MCQ

1. Which sorting algorithm is known for its ability to handle very large datasets efficiently in Java?

1. Bubble Sort
2. Insertion Sort
3. Merge Sort
4. Selection Sort

2. What is the main advantage of using the Quick Sort algorithm over Merge Sort?

1. Quick Sort is stable.
2. Quick Sort has better worst-case time complexity.
3. Quick Sort requires less auxiliary space.
4. Quick Sort is simpler to implement.

3. Which of the following is NOT a stable sorting algorithm in Java?

1. Bubble Sort
2. Insertion Sort
3. Merge Sort
4. Quick Sort

4. In Java, which sorting algorithm is often used as the default algorithm for sorting arrays of objects?

1. Bubble Sort
2. Insertion Sort
3. Merge Sort
4. Tim Sort

5. What is the time complexity of the Tim Sort algorithm in the worst-case scenario?

1. O(n log n)
2. O(n^2)
3. O(n log n) to O(n^2)
4. O(log n)