1.选择排序
#include<stdio.h>
int main(){
int arr[10] = {1,4,2,4,45,54,24,2,15,10};
for (int i = 0; i < 10-1; i++)
{
for(int j =i+1;j<10;j++){
if(arr[i]>arr[j]){
int temp = arr[i];
arr[i]=arr[j];
arr[j]= temp;
}
}
}
for(int i=0;i<10;i++){
printf("%d\t",arr[i]);
}
return 0;
}
2.冒泡排序
#include<stdio.h>
int main(){
int arr[10] = {1,4,2,4,45,54,24,2,15,10};
for (int i = 0; i < 10-1; i++)
{
for(int j =0;j<10-1-i;j++){
if(arr[j]>arr[j+1]){
int temp= arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
}
}
for(int i=0;i<10;i++){
printf("%d\t",arr[i]);
}
return 0;
}
3.插入排序