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 — java-basics/java-programs/BubbleSort.java at master · learning-zone/java-basics Expand file tree/ Copy pathBubbleSort.javaMore file actions 44 lines (40 loc) · 865 Bytes / Copy pathBubbleSort.javaFile metadata and controls44 lines (40 loc) · 865 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 42 43 44 package misc; /** * Steps:- * Bubble Sort algorithm that works by repeatedly swapping the adjacent elements if they are in wrong order. * */ public class BubbleSort { public void bubbleSort(int[] arr) { boolean swap; int n = arr.length; int tmp = 0; for (int i = 0; i < n ; i++) { swap = false; for (int j = 1; j < n-i; j++) { if (arr[j-1] > arr[j]) { tmp = arr[j]; arr[j] = arr[j-1]; arr[j-1] = tmp; swap = true; } } if (!swap){ break; } } } void printArray(int arr[]) { for (int i = 0; i < arr.length; i++) { System.out.print(arr[i] + " "); } System.out.println(""); } public static void main(String[] args) { BubbleSort obj = new BubbleSort(); int arr[] = { 64, 34, 25, 12, 22, 11, 90 }; obj.bubbleSort(arr); System.out.println("Sorted Array"); obj.printArray(arr); } } |
| 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. |