This is a Java Program which arranges all the elements in an array in ascending order
Here initially first element in array and its next element are compared array[0] and array[1] , if array[1] is greater then the values are swapped, and the process continues with 2 and 3 elements and son on until the end of array is reached.
Finally the obtained array is the sorted array in ascending order.
PROGRAM :
OUTPUT :
Here initially first element in array and its next element are compared array[0] and array[1] , if array[1] is greater then the values are swapped, and the process continues with 2 and 3 elements and son on until the end of array is reached.
Finally the obtained array is the sorted array in ascending order.
PROGRAM :
package codingcorner.in; import java.util.Scanner; public class AscendingOrder { public static void main(String[] args) { int i, j, no, temp; Scanner scan = new Scanner(System.in); System.out.print("\nEnter the number of Elements: \t"); no = scan.nextInt(); int arr[] = new int[no]; for (i = 0; i < no; i++) { System.out.print("\nEnter Element" + (i + 1)); arr[i] = scan.nextInt(); } scan.close(); for (i = 0; i < no; i++) { for (j = i; j < no; j++) { if (arr[i] > arr[j]) { temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; } } } System.out.print("\nSorted array: "); for (i = 0; i < no; i++) { System.out.print("\t" + arr[i]); } } }
OUTPUT :
Java - Sorting elements in an array in ascending order |
No comments:
Post a Comment