C#冒泡法、选择排序法、插入法

/插入法
#include<stdio.h>
void InsertSort(int arr[], int len)
{
int i = 0;
int tmp = 0;
for (i = 0; i < len - 1; i++)
{
tmp = arr[i];
int j = 0;
for (j = i - 1; j >= 0; j–)
{
if (arr[j]>tmp)
{
arr[j + 1] = arr[j];
}
else
{
break;
}
}
arr[j + 1] = tmp;
}
}
int main()
{
int arr[] = { 7, 15, 18, 33, 5, 9, 38, 22 };
int len = sizeof(arr) / sizeof(arr[0]);
InsertSort(arr, len);
int i = 0;
for (i = 0; i < len; i++)
{
printf("%d “, arr[i]);
}
return 0;
}
//选择排序法
#include<stdio.h>
void SelectSort(int arr[], int len)
{
int i = 0;
for (i = 0; i < len - 1; i++)
{
int j = 0;
for (j = i + 1; j < len; j++)
{
int tmp = 0;
if (arr[i]>arr[j])
{
tmp = arr[i];
arr[i] = arr[j];
arr[j] = tmp;
}
}
}
}
int main()
{
int arr[] = { 7, 15, 18, 33, 5, 9, 38, 22 };
int len = sizeof(arr) / sizeof(arr[0]);
SelectSort(arr, len);
int i = 0;
for (i = 0; i < len; i++)
{
printf(”%d “, arr[i]);
}
return 0;
}
///冒泡法
#include<stdio.h>
void BubbleSort(int arr[], int len)
{
int i = 0;
for (i = 0; i < len - 1; i++)
{
int j = 0;
int count = 0;//优化程序，如果进行到有序地方，则跳出循环
for (j = 0; j < len - 1 - i; j++)
{
if (arr[j]>arr[j + 1])
{
int tmp = 0;
tmp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = tmp;
count++;
}
while (count == 0)
{
break;
}
}
}
}
int main()
{
int arr[] = { 7, 15, 18, 33, 5, 9, 38, 22 };
int len = sizeof(arr) / sizeof(arr[0]);
BubbleSort(arr, len);
int i = 0;
for (i = 0; i < len; i++)
{
printf(”%d ", arr[i]);
}
return 0;
}