for (int i = 1; i < N; i++){
insertArray(array1, i, array1[i]);
// 把值key插入到前n个数已经排好序的数组arr中void Insert(int arr[],int n,int key)
{
for (int i = n-1; i >= 0; i--)
{
if (key > arr[i])
{
arr[i+1] = key;
break;
}
else
{
arr[i + 1] = arr[i];
arr[i] = key;
}
}
}
选择排序
void Select(int arr[], int n)
{
int k;
int t;
for (int i = 0; i < n; i++)
{
k = i;
for (int j = i + 1; j < n; j++)
{
if (arr[j] < arr[k])
k = j;
if(k!=i)
{
t = arr[i];
arr[i] = arr[k];
arr[k] = t;
}
}
}
}
冒泡排序
void Bubble(int arr[], int n)
{
int t;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n-i-1; j++)
{
if (arr[j] > arr[j + 1])
{
t = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = t;
}
}
}
}