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

<\/p>\n

This article describes how to implement the bubble sort algorithm in C#. Bubble sort is one of the most basic sorting algorithms and often appears in various algorithm tests. In this post, we will take a detailed look at the principle of bubble sort and examine an example implemented in C#.<\/p>\n

What is Bubble Sort?<\/h2>\n

Bubble sort is a simple sorting algorithm that compares adjacent elements of an array to arrange the order of the two elements. One can visualize the largest (or smallest) element ‘bubbling’ up to the end of the array. This algorithm can be implemented simply, but it is not an efficient sorting algorithm. Its time complexity is O(n^2).<\/p>\n

Problem Description<\/h2>\n

Sort the given integer array in ascending order using the bubble sort algorithm.<\/p>\n

Input<\/h3>\n
\n- Input: Integer array arr = [64, 34, 25, 12, 22, 11, 90]\n<\/pre>\n
Output<\/h3>\n
\n- Output: Sorted array [11, 12, 22, 25, 34, 64, 90]\n<\/pre>\n
Explanation of the Bubble Sort Algorithm<\/h2>\n
Bubble sort follows these steps:<\/p>\n
    \n
  1. Check the length of the array.<\/li>\n
  2. Use two nested loops to iterate through all elements of the array.<\/li>\n
  3. Compare two adjacent elements and swap them if they are in the wrong order.<\/li>\n
  4. After one full comparison, the largest element moves to the end of the array.<\/li>\n
  5. Repeat this process N-1 times to sort the array.<\/li>\n<\/ol>\n
    Implementing Bubble Sort in C#<\/h2>\n
    Now, let’s implement the above process in C# code.<\/p>\n
    \n\nusing System;\n\nclass Program\n{\n    static void Main()\n    {\n        int[] arr = { 64, 34, 25, 12, 22, 11, 90 };\n        Console.WriteLine(\"Original array:\");\n        PrintArray(arr);\n        \n        BubbleSort(arr);\n        \n        Console.WriteLine(\"Sorted array:\");\n        PrintArray(arr);\n    }\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 PrintArray(int[] arr)\n    {\n        foreach (var item in arr)\n        {\n            Console.Write(item + \" \");\n        }\n        Console.WriteLine();\n    }\n}\n<\/code>\n<\/pre>\n
    Explanation of the Code<\/h2>\n
    The above code is an example of implementing bubble sort using a simple C# console application.<\/p>\n