{"id":34538,"date":"2024-11-01T09:29:09","date_gmt":"2024-11-01T09:29:09","guid":{"rendered":"http:\/\/atmokpo.com\/w\/?p=34538"},"modified":"2024-11-01T11:40:51","modified_gmt":"2024-11-01T11:40:51","slug":"javascript-coding-test-course-bubble-sort-program-1","status":"publish","type":"post","link":"https:\/\/atmokpo.com\/w\/34538\/","title":{"rendered":"JavaScript Coding Test Course, Bubble Sort Program 1"},"content":{"rendered":"

<\/p>\n

\n

Let’s learn about the essential algorithm for coding tests, Bubble Sort.<\/p>\n<\/header>\n

\n

1. Problem Definition<\/h2>\n

\n Implement the Bubble Sort algorithm that takes an array as input and sorts it in ascending order.
\n Bubble Sort operates by comparing two adjacent elements and repeatedly moving the largest element to the end of the array.\n <\/p>\n

Input Format<\/h3>\n

\n The input is an integer array with a length between 1 and 1000. Each element can have a value between -10,000 and 10,000.\n <\/p>\n

Output Format<\/h3>\n

\n Return the array sorted in ascending order.\n <\/p>\n

2. Problem Approach<\/h2>\n

\n Bubble Sort is a very intuitive sorting algorithm. The basic approach is to compare two adjacent elements,
\n and if they are not in order, swap them repeatedly until the entire array is sorted. This process is repeated for the size of the array,
\n and continues until no more swaps occur. This way, the largest value moves to the end of the array in each step.\n <\/p>\n

2.1. Algorithm Steps<\/h3>\n
    \n
  1. Obtain the length of the array.<\/li>\n
  2. Use two indices to compare the elements of the array.<\/li>\n
  3. If adjacent elements are not sorted, swap them.<\/li>\n
  4. Consider the sorting complete if no swaps occur during a full pass.<\/li>\n
  5. Repeat the above process and ultimately return the array sorted in ascending order.<\/li>\n<\/ol>\n

    3. Bubble Sort Code Implementation<\/h2>\n

    \n Now let’s implement the above algorithm in JavaScript. The basic Bubble Sort function is as follows.\n <\/p>\n

    \n\n\/\/ Bubble Sort function implementation\nfunction bubbleSort(arr) {\n    let n = arr.length;  \/\/ Store the length of the array\n\n    \/\/ Repeat to sort the array\n    for (let i = 0; i < n - 1; i++) {\n        let swapped = false;  \/\/ Variable to check if a swap has occurred\n\n        \/\/ Compare and swap adjacent elements\n        for (let j = 0; j < n - i - 1; j++) {\n            if (arr[j] > arr[j + 1]) {\n                \/\/ Swap\n                let temp = arr[j];\n                arr[j] = arr[j + 1];\n                arr[j + 1] = temp;\n                swapped = true;  \/\/ Record that a swap has occurred\n            }\n        }\n\n        \/\/ Exit if no swaps have occurred\n        if (!swapped) break;\n    }\n\n    return arr;  \/\/ Return the sorted array\n}\n\n\/\/ Test\nlet testArray = [64, 34, 25, 12, 22, 11, 90];\nconsole.log(bubbleSort(testArray));  \/\/ [11, 12, 22, 25, 34, 64, 90]\n<\/code>\n        <\/pre>\n
    4. Time Complexity Analysis<\/h2>\n
    \n            The time complexity of the Bubble Sort algorithm is O(n\u00b2) in the worst case. This is due to the presence of two nested loops, each proportional to the length of the array.
    \n            The best case (when the array is already sorted) is O(n). In this case, no swaps occur, and the process terminates after the first step.
    \n            Bubble Sort is generally inefficient, and it is advisable to use other algorithms (e.g., Quick Sort, Merge Sort) when sorting large datasets in practice.\n        <\/p>\n
    4.1. Space Complexity<\/h3>\n
    \n            The space complexity of Bubble Sort is O(1). It does not use any unnecessary additional memory,
    \n            as sorting is performed within the given array.\n        <\/p>\n
    5. Advantages and Disadvantages of Bubble Sort<\/h2>\n
    Advantages<\/h3>\n