{"id":33366,"date":"2024-11-01T09:15:55","date_gmt":"2024-11-01T09:15:55","guid":{"rendered":"http:\/\/atmokpo.com\/w\/?p=33366"},"modified":"2024-11-01T11:39:00","modified_gmt":"2024-11-01T11:39:00","slug":"java-coding-test-course-bubble-sort-program-1","status":"publish","type":"post","link":"https:\/\/atmokpo.com\/w\/33366\/","title":{"rendered":"Java Coding Test Course, Bubble Sort Program 1"},"content":{"rendered":"

<\/p>\n

1. Problem Statement<\/h2>\n

Implement the bubble sort algorithm to sort the given integer array in ascending order.
\n Bubble sort is one of the simplest sorting algorithms, which sorts by comparing two adjacent elements.
\n The basic idea of this algorithm is to repeatedly compare each element of the array to send the smaller value forward.<\/p>\n

2. Algorithm Explanation<\/h2>\n

The bubble sort algorithm works as follows:<\/p>\n

    \n
  1. Compare two adjacent elements from the beginning to the end of the array. If the first element is greater than the second, swap the two elements.<\/li>\n
  2. Repeat this process until reaching the end of the array.<\/li>\n
  3. When reaching the end of the array, the largest element will have moved to the back.<\/li>\n
  4. Repeat the above process for the size of the array – 1. In each iteration, the maximum value moves to the back of the array, so the remaining elements will be compared and swapped again.<\/li>\n<\/ol>\n

    3. Example<\/h2>\n

    For example, let’s assume the given array is as follows:<\/p>\n

    [64, 34, 25, 12, 22, 11, 90]<\/code><\/pre>\n
    When applying bubble sort, the following steps occur:<\/p>\n
      \n
    1. 1st pass: [34, 25, 12, 22, 11, 64, 90]<\/li>\n
    2. 2nd pass: [25, 12, 22, 11, 34, 64, 90]<\/li>\n
    3. 3rd pass: [12, 22, 11, 25, 34, 64, 90]<\/li>\n
    4. 4th pass: [12, 11, 22, 25, 34, 64, 90]<\/li>\n
    5. 5th pass: [11, 12, 22, 25, 34, 64, 90]<\/li>\n<\/ol>\n
      Once this process is completed, the array will be sorted in ascending order.<\/p>\n
      4. Java Implementation<\/h2>\n
      The following is the Java code that implements the bubble sort algorithm described above:<\/p>\n
      \npublic class BubbleSort {\n    public static void bubbleSort(int[] arr) {\n        int n = arr.length;\n        boolean swapped;\n        for (int i = 0; i < n - 1; i++) {\n            swapped = false;\n            for (int j = 0; j < n - i - 1; j++) {\n                if (arr[j] > arr[j + 1]) {\n                    \/\/ Swap elements\n                    int temp = arr[j];\n                    arr[j] = arr[j + 1];\n                    arr[j + 1] = temp;\n                    swapped = true; \/\/ Indicate that a swap occurred\n                }\n            }\n            \/\/ If no swaps occurred, the array is already sorted, so exit\n            if (!swapped) {\n                break;\n            }\n        }\n    }\n\n    public static void main(String[] args) {\n        int[] arr = {64, 34, 25, 12, 22, 11, 90};\n        bubbleSort(arr);\n        System.out.println(\"Sorted array:\");\n        for (int i : arr) {\n            System.out.print(i + \" \");\n        }\n    }\n}\n    <\/code><\/pre>\n
      5. Code Explanation<\/h2>\n
      The above code includes the following main features:<\/p>\n