头文件:#include <algorithm>
min_element()//最小值
max_element()//最大值
nth_element()//第n大
一、最大最小值
bool compare(int i,int j)
{
return i<j;
}
int main()
{
int a[] = { 5,6,7,8,4,2,1,3,0 };
int len = sizeof(a) / sizeof(int);
vector<int>myvec(a, a + len);
//输出地址
cout << max_element(a, a + len, compare) << endl;
//输出值(8)
cout << *max_element(a, a + len, compare) << endl;//按自己写的方法来
cout << *max_element(a, a + len) << endl;//按默认方法
cout << *max_element(myvec.begin(), myvec.end()) << endl;
}
二、中值(第n大)
nth_element(begin,nth,end,compare);//一般格式
该排序后,数组里面nth左边会是比nth小的元素,右边则比它大
int main()
{
int a[] = { 5,6,7,8,4,2,1,3,0 };
int len = sizeof(a) / sizeof(int);
vector<int>myvec(a, a + len);
nth_element(a,a+2,a+len);
for (int i = 0; i < len; i++)
{
cout<<a[i]<<" ";
}cout<<endl;
nth_element(myvec.begin(),myvec.begin()+2,myvec.end());
for (int i : myvec)
{
cout<<i<<" ";
}cout<<endl;
//输出中值
cout<<myvec[myvec.size()/2]<<endl;
}
在vs里面,该函数会自动将数组排好序,而devc++里面则不会
vs:
devc++:
另外sort排序比nth_element要慢上很多
测试:
#include<iostream>
#include<algorithm>
#include <windows.h>
using namespace std;
int main()
{
int a[100005];
for (int i = 0; i < 100000; i++)
{
a[i]=rand()%100000;
}
int len = sizeof(a) / sizeof(int);
long start_time = GetTickCount64(); //获取开始执行时间
nth_element(a,a+2,a+len);
long end_time = GetTickCount64(); //获取结束时间
cout<<"nth_element时间为:"<<end_time - start_time<<endl;
int b[100005];
for (int i = 0; i < 100000; i++)
{
b[i] = rand() % 100000;
}
len = sizeof(b) / sizeof(int);
start_time = GetTickCount64(); //获取开始执行时间
sort(b,b+len);
end_time = GetTickCount64(); //获取结束时间
cout << "sort时间为:" << end_time - start_time << endl;
}
vs三次测试结果:
如果有不正确的地方,望指正