1.sort 必须添加头文件#include <algorithm>
2.qsort 用于c语言,头文件是#include<stdlib.h>
sort属于标准模板库,只适用于c++,c语言不支持.
#include<iostream>
#include <algorithm>
using namespace std;
int main()
{
int a[] = { 2, 5, 6, 4, 2, 3, 5, 8, 9, 6, 5, 4, 2, 3 };
sort(a, a + sizeof(a) / sizeof(a[0]));
for (int i = 0; i < sizeof(a) / sizeof(a[0]); i++)
{
cout << a[i] << "\t";
}
return 0;
}
以上默认的是升序,要自己设定升序和降序:
#include<iostream>
#include <algorithm>
using namespace std;
bool compare(int a, int b)
{
return a > b;//升序
// return a < b;//降序
}
int main()
{
int a[] = { 2, 5, 6, 4, 2, 3, 5, 8, 9, 6, 5, 4, 2, 3 };
sort(a, a + sizeof(a) / sizeof(a[0]), compare);
for (int i = 0; i < sizeof(a) / sizeof(a[0]); i++)
{
cout << a[i] << "\t";
}
return 0;
}
2.qsort 用于c语言,头文件是#include<stdlib.h>
void qsort(void *base,int nelem,int width,int (*fcmp)(const void *,const void *));
#include<stdio.h>
#include<stdlib.h>
int comp(const void *a,const void *b)
{
return *(int *)a >*(int *)b;//升序
// return *(int *)a <*(int *)b;//降序
}
int main()
{
int a[] = { 2, 5, 6, 4, 2, 3, 5, 8, 9, 6, 5, 4, 2, 3 };
qsort(a, sizeof(a) / sizeof(a[0]),sizeof(int),comp);
for (int i = 0; i < sizeof(a) / sizeof(a[0]); i++)
{
printf("%d\t", a[i]);
}
printf("/n");
}