1.max(),min(),abs()
#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
int x=1,y=-2;
printf("%d %d\n",max(x,y),min(x,y));
printf("%d %d\n",abs(x),abs(y));
return 0;
}
2.swap
#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
int x=1,y=2;
swap(x,y);
printf("%d %d\n",x,y);
return 0;
}
3.reverse()
#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
int a[10]={10,11,12,13,14,15};
reverse(a,a+4);//将a[0]到a[3]反转
for(int i=0;i<6;i++)
{
printf("%d ",a[i]);
}
return 0;
}
4.next_permutation
#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
int a[10]={1,2,3};
do{
printf("%d%d%d\n",a[0],a[1],a[2]);
}while(next_permutation(a,a+3));
}
//fill()
#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
int a[5]={1,2,3,4,5};
fill(a,a+5,233);
for(int i=0;i<5;i++)
{
printf("%d ",a[i]);
}
return 0;
}
//6.sort()略