{"id":34010,"date":"2024-11-01T09:23:02","date_gmt":"2024-11-01T09:23:02","guid":{"rendered":"http:\/\/atmokpo.com\/w\/?p=34010"},"modified":"2024-11-01T10:54:19","modified_gmt":"2024-11-01T10:54:19","slug":"c-coding-test-course-bubble-sort-program-1","status":"publish","type":"post","link":"https:\/\/atmokpo.com\/w\/34010\/","title":{"rendered":"C# Coding Test Course, Bubble Sort Program 1"},"content":{"rendered":"

<\/p>\n

\n

Problem Description<\/h2>\n

\n Given an integer array, write a program to sort the array in ascending order.
\n The program must be implemented using the ‘bubble sort’ algorithm.
\n Bubble sort works by comparing two adjacent elements and swapping them if they are in the wrong order.
\n This process is repeated until the end of the array, and at the end of one complete pass, the last element will be in sorted order.
\n Therefore, the number of sorted elements increases by one after each pass.\n <\/p>\n

Input Format<\/h2>\n

\n The first line contains the integer N (1 \u2264 N \u2264 100).
\n The second line contains N integers, with each integer in the range of -1000 \u2264 A[i] \u2264 1000.\n <\/p>\n

Output Format<\/h2>\n

\n Print the sorted N integers, separated by spaces, on a single line.\n <\/p>\n

Example Input<\/h2>\n
\n        5\n        5 3 2 4 1\n        <\/pre>\n
Example Output<\/h2>\n
\n        1 2 3 4 5\n        <\/pre>\n<\/section>\n
\n
Introduction to Bubble Sort Algorithm<\/h2>\n
\n            The bubble sort algorithm is one of the simplest sorting algorithms, which works by iteratively traversing the array
\n            and comparing adjacent elements to sort them. This algorithm is not efficient and has a time complexity of O(N\u00b2),
\n            but it is often used for educational purposes due to its simplicity in understanding and implementation.\n        <\/p>\n
\n            The basic operation of bubble sort is as follows:\n        <\/p>\n
    \n
  1. Start from the first element of the array and compare two adjacent elements.<\/li>\n
  2. If the first element is greater than the second, swap their positions.<\/li>\n
  3. Repeat this process until the end of the array.<\/li>\n
  4. After one complete pass, the last element is sorted, so decrease the size of the array by one and repeat.<\/li>\n
  5. Continue this process until the entire array is sorted.<\/li>\n<\/ol>\n<\/section>\n
    \n
    C# Bubble Sort Implementation<\/h2>\n
    \n            Now, let’s implement bubble sort in C# based on the algorithm above.
    \n            Below is the C# code that implements bubble sort.\n        <\/p>\n
    \nusing System;\n\nclass Program\n{\n    static void BubbleSort(int[] arr)\n    {\n        int n = arr.Length;\n        for (int i = 0; i < n - 1; i++)\n        {\n            for (int j = 0; j < n - i - 1; j++)\n            {\n                if (arr[j] > arr[j + 1])\n                {\n                    \/\/ Swap arr[j] and arr[j + 1]\n                    int temp = arr[j];\n                    arr[j] = arr[j + 1];\n                    arr[j + 1] = temp;\n                }\n            }\n        }\n    }\n\n    static void Main(string[] args)\n    {\n        int n = int.Parse(Console.ReadLine());\n        int[] arr = Array.ConvertAll(Console.ReadLine().Split(), int.Parse);\n        \n        BubbleSort(arr);\n        \n        Console.WriteLine(string.Join(\" \", arr));\n    }\n}\n        <\/code><\/pre>\n
    \n            In the code above, we define the BubbleSort<\/code> method which sorts the array.
    \n            This method uses two nested loops to compare and swap adjacent elements to sort the array.
    \n            The Main<\/code> method takes the size and elements of the array as input from the user,
    \n            calls the BubbleSort<\/code> method to sort the array, and then prints the result.\n        <\/p>\n<\/section>\n
    \n
    Code Execution and Testing<\/h2>\n
    \n            To run the code, you need to use an IDE or editor that supports C#.
    \n            You can use IDEs like Visual Studio or Visual Studio Code.
    \n            After entering the code, click the Run<\/code> button or press Ctrl + F5<\/code> to execute.\n        <\/p>\n
    \n            After execution, if you input integers as in the example, the sorted result in ascending order will be output.
    \n            It is advisable to use various test cases to verify the accuracy of the algorithm.\n        <\/p>\n
    Test Cases<\/h3>\n