C#几种排序算法
程序员文章站
2022-06-03 10:58:31
作者:sabine 【导读】本文介绍了c#的四种排序算法:冒泡排序、选择排序、插入排序和希尔排序 冒泡排序 using system; n...
作者:sabine 【导读】本文介绍了c#的四种排序算法:冒泡排序、选择排序、插入排序和希尔排序
冒泡排序
using system;
namespace bubblesorter
{ public class bubblesorter
{ public void sort(int [] list)
{ int i,j,temp;
bool done=false;
j=1;
while((j<list.length)&&(!done))
{ done=true;
for(i=0;i<list.length-j;i++)
{
if(list[i]>list[i+1])
{
done=false;
temp=list[i];
list[i]=list[i+1];
list[i+1]=temp;
} }
j++; }
} }
public class mainclass
{ public static void main()
{
int[] iarrary=new int[]{1,5,13,6,10,55,99,2,87,12,34,75,33,47};
bubblesorter sh=new bubblesorter();
sh.sort(iarrary);
for(int m=0;m<iarrary.length;m++)
console.write("{0} ",iarrary[m]);
console.writeline();
} }
}
选择排序
using system;
namespace selectionsorter
{ public class selectionsorter
{ private int min;
public void sort(int [] list)
{ for(int i=0;i<list.length-1;i++)
{ min=i;
for(int j=i+1;j<list.length;j++)
{ if(list[j]<list[min])
min=j;
}
int t=list[min];
list[min]=list[i];
list[i]=t;
} }
}
public class mainclass
{ public static void main()
{
int[] iarrary=new int[]{1,5,3,6,10,55,9,2,87,12,34,75,33,47};
selectionsorter ss=new selectionsorter();
ss.sort(iarrary);
for(int m=0;m<iarrary.length;m++)
console.write("{0} ",iarrary[m]);
console.writeline();
} }
}
插入排序
using system;
namespace insertionsorter
{ public class insertionsorter
{ public void sort(int [] list)
{ for(int i=1;i<list.length;i++)
{ int t=list[i];
int j=i;
while((j>0)&&(list[j-1]>t))
{ list[j]=list[j-1];
--j;
}
list[j]=t; }
}
}
public class mainclass
{ public static void main()
{
int[] iarrary=new int[]{1,13,3,6,10,55,98,2,87,12,34,75,33,47};
insertionsorter ii=new insertionsorter();
ii.sort(iarrary);
for(int m=0;m<iarrary.length;m++)
console.write("{0}",iarrary[m]);
console.writeline();
} }
}
希尔排序
希尔排序是将组分段,进行插入排序.
using system;
namespace shellsorter
{
public class shellsorter
{
public void sort(int [] list)
{
int inc;
for(inc=1;inc<=list.length/9;inc=3*inc+1);
for(;inc>0;inc/=3)
{
for(int i=inc+1;i<=list.length;i+=inc)
{
int t=list[i-1];
int j=i;
while((j>inc)&&(list[j-inc-1]>t))
{
list[j-1]=list[j-inc-1];
j-=inc;
}
list[j-1]=t;
} }
} }
public class mainclass
{ public static void main()
{
int[] iarrary=new int[]{1,5,13,6,10,55,99,2,87,12,34,75,33,47};
shellsorter sh=new shellsorter();
sh.sort(iarrary);
for(int m=0;m<iarrary.length;m++)
console.write("{0} ",iarrary[m]);
console.writeline();
} }
}
快速排序
using system;
using system.collections.generic;
using system.text;
namespace solodatastructure
{
class myquicksort
{
/**//// <summary>
/// 快速排序算法
/// </summary>
/// 快速排序为不稳定排序,时间复杂度o(nlog2n),为同数量级中最快的排序方法
/// <param name="arr">划分的数组</param>
/// <param name="low">数组低端上标</param>
/// <param name="high">数组高端下标</param>
/// <returns></returns>
static int partition(int[] arr, int low, int high)
{
//进行一趟快速排序,返回中心轴记录位置
// arr[0] = arr[low];
int pivot = arr[low];//把中心轴置于arr[0]
while (low < high)
{
while(low<high && arr[high]>=pivot)
--high;
//将比中心轴记录小的移到低端
swap(ref arr[high],ref arr[low]);
while(low<high && arr[low]<=pivot)
++low;
swap(ref arr[high],ref arr[low]);
//将比中心轴记录大的移到高端
}
arr[low] = pivot; //中心轴移到正确位置
return low; //返回中心轴位置
}
static void swap(ref int i, ref int j)
{
int t;
t = i;
i = j;
j = t;
}
static void quicksort(int[] arr,int low,int high)
{
if (low < high-1)//当 arr[low,high]为空或只一个记录无需排序
{
int pivot = partition(arr,low,high);
quicksort(arr,low,pivot-1);
quicksort(arr,pivot+1,high);
}
}
static void main(string[] args)
{
int[] arr=new int[]{54,62,99,14,28,1,8,77,99,3,110};
quicksort(arr, 0, arr.length-1);
console.write("data after quicksort:");
foreach (int i in arr)
{
console.write(i+",");
}
console.readline();
}
}
}
冒泡排序
using system;
namespace bubblesorter
{ public class bubblesorter
{ public void sort(int [] list)
{ int i,j,temp;
bool done=false;
j=1;
while((j<list.length)&&(!done))
{ done=true;
for(i=0;i<list.length-j;i++)
{
if(list[i]>list[i+1])
{
done=false;
temp=list[i];
list[i]=list[i+1];
list[i+1]=temp;
} }
j++; }
} }
public class mainclass
{ public static void main()
{
int[] iarrary=new int[]{1,5,13,6,10,55,99,2,87,12,34,75,33,47};
bubblesorter sh=new bubblesorter();
sh.sort(iarrary);
for(int m=0;m<iarrary.length;m++)
console.write("{0} ",iarrary[m]);
console.writeline();
} }
}
选择排序
using system;
namespace selectionsorter
{ public class selectionsorter
{ private int min;
public void sort(int [] list)
{ for(int i=0;i<list.length-1;i++)
{ min=i;
for(int j=i+1;j<list.length;j++)
{ if(list[j]<list[min])
min=j;
}
int t=list[min];
list[min]=list[i];
list[i]=t;
} }
}
public class mainclass
{ public static void main()
{
int[] iarrary=new int[]{1,5,3,6,10,55,9,2,87,12,34,75,33,47};
selectionsorter ss=new selectionsorter();
ss.sort(iarrary);
for(int m=0;m<iarrary.length;m++)
console.write("{0} ",iarrary[m]);
console.writeline();
} }
}
插入排序
using system;
namespace insertionsorter
{ public class insertionsorter
{ public void sort(int [] list)
{ for(int i=1;i<list.length;i++)
{ int t=list[i];
int j=i;
while((j>0)&&(list[j-1]>t))
{ list[j]=list[j-1];
--j;
}
list[j]=t; }
}
}
public class mainclass
{ public static void main()
{
int[] iarrary=new int[]{1,13,3,6,10,55,98,2,87,12,34,75,33,47};
insertionsorter ii=new insertionsorter();
ii.sort(iarrary);
for(int m=0;m<iarrary.length;m++)
console.write("{0}",iarrary[m]);
console.writeline();
} }
}
希尔排序
希尔排序是将组分段,进行插入排序.
using system;
namespace shellsorter
{
public class shellsorter
{
public void sort(int [] list)
{
int inc;
for(inc=1;inc<=list.length/9;inc=3*inc+1);
for(;inc>0;inc/=3)
{
for(int i=inc+1;i<=list.length;i+=inc)
{
int t=list[i-1];
int j=i;
while((j>inc)&&(list[j-inc-1]>t))
{
list[j-1]=list[j-inc-1];
j-=inc;
}
list[j-1]=t;
} }
} }
public class mainclass
{ public static void main()
{
int[] iarrary=new int[]{1,5,13,6,10,55,99,2,87,12,34,75,33,47};
shellsorter sh=new shellsorter();
sh.sort(iarrary);
for(int m=0;m<iarrary.length;m++)
console.write("{0} ",iarrary[m]);
console.writeline();
} }
}
快速排序
using system;
using system.collections.generic;
using system.text;
namespace solodatastructure
{
class myquicksort
{
/**//// <summary>
/// 快速排序算法
/// </summary>
/// 快速排序为不稳定排序,时间复杂度o(nlog2n),为同数量级中最快的排序方法
/// <param name="arr">划分的数组</param>
/// <param name="low">数组低端上标</param>
/// <param name="high">数组高端下标</param>
/// <returns></returns>
static int partition(int[] arr, int low, int high)
{
//进行一趟快速排序,返回中心轴记录位置
// arr[0] = arr[low];
int pivot = arr[low];//把中心轴置于arr[0]
while (low < high)
{
while(low<high && arr[high]>=pivot)
--high;
//将比中心轴记录小的移到低端
swap(ref arr[high],ref arr[low]);
while(low<high && arr[low]<=pivot)
++low;
swap(ref arr[high],ref arr[low]);
//将比中心轴记录大的移到高端
}
arr[low] = pivot; //中心轴移到正确位置
return low; //返回中心轴位置
}
static void swap(ref int i, ref int j)
{
int t;
t = i;
i = j;
j = t;
}
static void quicksort(int[] arr,int low,int high)
{
if (low < high-1)//当 arr[low,high]为空或只一个记录无需排序
{
int pivot = partition(arr,low,high);
quicksort(arr,low,pivot-1);
quicksort(arr,pivot+1,high);
}
}
static void main(string[] args)
{
int[] arr=new int[]{54,62,99,14,28,1,8,77,99,3,110};
quicksort(arr, 0, arr.length-1);
console.write("data after quicksort:");
foreach (int i in arr)
{
console.write(i+",");
}
console.readline();
}
}
}