# C# Bubble Sort Algorithm Implementation

The simplest sorting algorithm is bubble sort. It works by repeatedly stepping through the list to be sorted. It walks from the first element to the last and compares each pair of elements and switches their positions if necessary.

For more information about Bubble Sort Algorithm:

http://en.wikipedia.org/wiki/Bubble_sort

**Implementation and Usage:**

int[] arr = new int[10] { 1, 5, 4, 11, 20, 8, 2, 98, 90, 16 }; BubbleSort(arr); Console.WriteLine("Sorted Values:"); for (int i = 0; i < arr.Length; i++) Console.WriteLine(arr[i]); //Output: //Sorted Values: //1 //2 //4 //5 //8 //11 //16 //20 //90 //98

private void BubbleSort(int[] arr) { for (int i = 0; i < arr.Length - 1; i++) { for (int j = arr.Length - 1; j > i; j--) { if (arr[j] < arr[j - 1]) { Swap(ref arr[j], ref arr[j - 1]); } } } } private void Swap(ref int x, ref int y) { int temp = x; x = y; y = temp; }

**See Also:**