c# sorting algorithms Bubble Sort code example
Example 1: bubble sort c#
using System;
namespace BubbleSort {
class Sorting {
static void Main(string[] args) {
int[] mixdata = { 56, 23, 2, 86, 45, 102 };
int temp;
for (int j = 0; j <= mixdata.Length - 2; j++) {
for (int i = 0; i <= mixdata.Length - 2; i++) {
if (mixdata[i] > mixdata[i + 1]) {
temp= mixdata[i + 1];
mixdata[i + 1] = mixdata[i];
mixdata[i] = temp;
}
}
}
Console.WriteLine("Bubble sort data:");
foreach (int p in mixdata)
Console.Write(p + " ");
Console.Read();
}
}
}
Example 2: .net bubble sort
using System;
namespace BubbleSort_3Languages
{
class Program
{
static void Main(string[] args)
{
int[] array = { 10, 9, 8, 7, 6, 5, 4, 3, 2, 1 };
bubblesort(array);
foreach (int element in array)
{
Console.WriteLine(element);
}
}
static void bubblesort(int[] array)
{
int len = array.Length;
for (int i = 0; i < len; i++)
{
for (int j = 0; j < len; j++)
{
int a = array[j];
if (a != array[len - 1])
{
int b = array[j + 1];
if (a > b)
{
array[j] = b;
array[j + 1] = a;
}
}
}
}
}
}
}
using System;
namespace BubbleSort {
class Sorting {
static void Main(string[] args) {
int[] mixdata = { 56, 23, 2, 86, 45, 102 };
int temp;
for (int j = 0; j <= mixdata.Length - 2; j++) {
for (int i = 0; i <= mixdata.Length - 2; i++) {
if (mixdata[i] > mixdata[i + 1]) {
temp= mixdata[i + 1];
mixdata[i + 1] = mixdata[i];
mixdata[i] = temp;
}
}
}
Console.WriteLine("Bubble sort data:");
foreach (int p in mixdata)
Console.Write(p + " ");
Console.Read();
}
}
}