stl sort算法之研究

类别:编程语言 点击:0 评论:0 推荐:

sort模板有两种:
---------------------------------------------------------------------
template<class RanIt>
    void sort(RanIt fist, RanIt last);
template<class RanIt, class Pred>
    void sort(RanIt fist, RanIt last, Pred pr);
---------------------------------------------------------------------
第一种模板,sort重排[first,last)之间的元素,产生一个按operate<排列的序列。sort将序列中的元素以升序方式排列。
第二种模板和前一个的行为相似,不过它用pr(X,Y)代替了operate<(x,y)。

例子:
------------------------------
// tmp1.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <vector>
#include <algorithm> // Include algorithms
#include <iostream>

using namespace std;

bool pr(int s1, int s2)
{
return s1>s2;
}

int main(int argc, char* argv[])
{
vector<int> vec;
vector<int>::iterator i;

vec.push_back (10);
vec.push_back (3);
vec.push_back (7);
sort(vec.begin(), vec.end(),pr); // Sort the vector

for (i = vec.begin(); i != vec.end(); i++)
{
cout<<*i<<endl;
}

return 0;
}

 

例子2:

--------------------------------------------------------------------------------------

// tmp1.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <vector>
#include <algorithm> // Include algorithms
#include <iostream>
#include <string>

using namespace std;

class myless
{

public:
  bool operator()( const int &a, const int &b) {
    return a < b;
  }
};

int main(int argc, char* argv[])
{
 vector<int> vec;
 vector<int>::iterator i;
 
 vec.push_back (10);
 vec.push_back (3);
 vec.push_back (7);
 sort(vec.begin(), vec.end(), myless()); // Sort the vector

 for (i = vec.begin(); i != vec.end(); i++)
 {
  cout<<*i<<endl;
 }

 return 0;
}

 

例子3:

------------------------------------------------------------------------

// tmp1.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <vector>
#include <algorithm> // Include algorithms
#include <iostream>
#include <string>

using namespace std;

typedef struct
{
 string first;
 string last;
}NAME;

bool sortbyfirst(const NAME& n1, const NAME& n2)
{
 return (n1.first<n2.first);
}

bool sortbylast(const NAME& n1, const NAME& n2)
{
 return (n1.last<n2.last);
}

int main(int argc, char* argv[])
{
 vector<NAME> contacts;
 vector<NAME>::iterator j;
 
 NAME tmp;
 tmp.first = "liu";
 tmp.last = "bei";
 contacts.push_back(tmp);

 tmp.first = "zhao";
 tmp.last = "yun";
 contacts.push_back(tmp);

 tmp.first = "gun";
 tmp.last = "yu";
 contacts.push_back(tmp);

 tmp.first = "zhang";
 tmp.last = "fei";
 contacts.push_back(tmp);

cout<<"by first:"<<endl; 

sort(contacts.begin(), contacts.end(), sortbyfirst);

 for(j=contacts.begin(); j!= contacts.end(); j++)
 {
  cout<<j->first<<" "<<j->last<<endl;
 }

 cout<<"by last:"<<endl;

 sort(contacts.begin(), contacts.end(), sortbylast);

 for(j=contacts.begin(); j!= contacts.end(); j++)
 {
  cout<<j->first<<" "<<j->last<<endl;
 }
 return 0;
}



 

本文地址:http://com.8s8s.com/it/it28254.htm