#include <stdio.h>
#include <stdlib.h>
/*插入排序算法代码*/
void insert_sort(int a[],int n)
{
int i = 0,j = 0;
for(i = 1;i < n;i++)
{
j = 0;
while(a[j] < a[i] && j < i)
{
j++;
}
if(i != j)
{
int temp = a[i];
for(int k = i;k > j;k--)
{
a[k] = a[k - 1];
}
a[j] = temp;
}
}
}
/*冒泡排序算法代码*/
void bubble_sort(int a[],int n)
{
for(int i = 0;i < n - 1;i++)
for(int j = 0;j < n - 1 - i;j++)
{
if(a[j] > a[j + 1])
{
int temp = a[j];
a[j] = a[j + 1];
a[j + 1] = temp;
}
}
}
/*选择排序算法代码*/
void select_sort(int a[],int n)
{
for(int i = 0;i < n - 1;i++)
{
int mindex = i;
for(int j = i + 1;j < n;j++)
{
if(a[i] > a[j])
mindex = j;
}
if(mindex != i)
{
int temp = a[i];
a[i] = a[mindex];
a[mindex] = temp;
}
}
}
/*快速排序算法代码*/
int partion(int array[],int low,int high)
{
int key;
key = array[low];
while(low < high)
{
while(low < high && array[high] >= key)
{
high--;
}
if(low < high)
array[low++] = array[high];
while(low < high && array[low] <= key)
{
low++;
}
if(low < high)
array[high--] = array[low];
}
array[low] = key;
return low;
}
void quick_sort(int array[],int start,int end)
{
int pos;
if(start < end)
{
pos = partion(array,start,end);
quick_sort(array,start,pos-1);
quick_sort(array,pos+1,end);
}
}
/*主函数代码*/
int main()
{
int a[5] = {100,3,2,7,4};
int i = 0;
printf("排序前:\n");
for(i = 0;i < 5;i++)
{
printf("%d\t",a[i]);
}
putchar('\n');
// insert_sort(a,5);
// bubble_sort(a,5);
// select_sort(a,5);
quick_sort(a,0,4);
printf("排序后:\n");
for(i = 0;i < 5;i++)
{
printf("%d\t",a[i]);
}
return 0;
}
#include <stdlib.h>
/*插入排序算法代码*/
void insert_sort(int a[],int n)
{
int i = 0,j = 0;
for(i = 1;i < n;i++)
{
j = 0;
while(a[j] < a[i] && j < i)
{
j++;
}
if(i != j)
{
int temp = a[i];
for(int k = i;k > j;k--)
{
a[k] = a[k - 1];
}
a[j] = temp;
}
}
}
/*冒泡排序算法代码*/
void bubble_sort(int a[],int n)
{
for(int i = 0;i < n - 1;i++)
for(int j = 0;j < n - 1 - i;j++)
{
if(a[j] > a[j + 1])
{
int temp = a[j];
a[j] = a[j + 1];
a[j + 1] = temp;
}
}
}
/*选择排序算法代码*/
void select_sort(int a[],int n)
{
for(int i = 0;i < n - 1;i++)
{
int mindex = i;
for(int j = i + 1;j < n;j++)
{
if(a[i] > a[j])
mindex = j;
}
if(mindex != i)
{
int temp = a[i];
a[i] = a[mindex];
a[mindex] = temp;
}
}
}
/*快速排序算法代码*/
int partion(int array[],int low,int high)
{
int key;
key = array[low];
while(low < high)
{
while(low < high && array[high] >= key)
{
high--;
}
if(low < high)
array[low++] = array[high];
while(low < high && array[low] <= key)
{
low++;
}
if(low < high)
array[high--] = array[low];
}
array[low] = key;
return low;
}
void quick_sort(int array[],int start,int end)
{
int pos;
if(start < end)
{
pos = partion(array,start,end);
quick_sort(array,start,pos-1);
quick_sort(array,pos+1,end);
}
}
/*主函数代码*/
int main()
{
int a[5] = {100,3,2,7,4};
int i = 0;
printf("排序前:\n");
for(i = 0;i < 5;i++)
{
printf("%d\t",a[i]);
}
putchar('\n');
// insert_sort(a,5);
// bubble_sort(a,5);
// select_sort(a,5);
quick_sort(a,0,4);
printf("排序后:\n");
for(i = 0;i < 5;i++)
{
printf("%d\t",a[i]);
}
return 0;
}