Hello friends, hope you are doing good. In this tutorial, I am going to share a c# program to sort the element using bubble sort algorithm.
Bubble sort is the very simple sorting algorithm and it is a comparison-based algorithm in which each pair of adjacent elements compared and then elements are swapped if they are not in sorted in order. If you a college student or just started learning the C# programming language, then this program will help you more to the better understanding of bubble sort.
Below is the algorithms to sort the number using Bubble sort.
1 2 3 4 5 6 7 8 9 10 | begin BubbleSort(list) for all elements of the list if list[i] > list[i+1] swap(list[i], list[i+1]) end if end for return list end BubbleSort |
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 | using System; class BubbleSortProgram { static void bubbleSort(int []arr, int n) { int i, j, temp; bool swapped; for (i = 0; i < n - 1; i++) { swapped = false; for (j = 0; j < n - i - 1; j++) { if (arr[j] > arr[j + 1]) { temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; swapped = true; } } if (swapped == false) break; } } static void printArray(int []arr, int size) { int i; for (i = 0; i < size; i++) Console.Write(arr[i] + " "); Console.WriteLine(); } public static void Main() { int []arr = {45, 30, 25, 10, 5, 18, 70}; int n = arr.Length; bubbleSort(arr,n); Console.WriteLine("Sorted array"); printArray(arr,n); } } |
Sorted array:
5, 10, 18, 25, 30, 45, 70
Liked this program? Do Like & share with your friends.
If you like FreeWebMentor and you would like to contribute, you can write an article and mail your article to [email protected] Your article will appear on the FreeWebMentor main page and help other developers.
