GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Basic-Java-Programs/SortArray.java at main · hey-its-d2t2/Basic-Java-Programs Expand file tree/ Copy pathSortArray.javaMore file actions 41 lines (31 loc) · 828 Bytes / Copy pathSortArray.javaFile metadata and controls41 lines (31 loc) · 828 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 /*Write a program to sort an array of numbers using any sorting technique */ import java.util.Scanner; class SortArray{ public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.print("Enter max value for array : "); int max = sc.nextInt(); int arr[] = new int[max]; System.out.println("Enter elements one by one : "); for(int i =0;i<arr.length;i++) arr[i] = sc.nextInt(); //sorting -> Bubble Sort int temp =0; for(int i=0;i<arr.length;i++) { for(int j =0;j<arr.length-1-i;j++) { if(arr[j] > arr[j+1]) { temp = arr[j]; arr[j] = arr[j+1]; arr[j+1] = temp; } } } System.out.println("Array after sorting : "); for(int i= 0;i<arr.length;i++) System.out.print(arr[i]+" "); } } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |