#include <iostream> #include <uuid/uuid.h> #include <ctime> #include <string.h> #include "BSTNode.h" #include <vector> using namespace std; void vectorSort7(); bool smaller(int i, int j); bool bigger(int i, int j); int main() { vectorSort7(); return 0; } bool smaller(int i, int j) { return (i < j); } bool bigger(int i, int j) { return i > j; }; struct myclass { bool operator()(int i, int j) { return (i < j); } } compObj; void vectorSort7() { srand(time(NULL)); vector<int> vec; for (int i = 0; i < 100; i++) { vec.push_back(rand()); } cout << "Comparer via function" << endl; std::sort(vec.begin(), vec.end(), smaller); vector<int>::iterator itr = vec.begin(); cout << "Order ascendingly" << endl; while (itr != vec.end()) { cout << *itr++ << "t"; } sort(vec.begin(), vec.end(), bigger); cout << "nnOrder ascendingly" << endl; itr = vec.begin(); while (itr != vec.end()) { cout << *itr++ << "t"; } cout<<"nnCompare via object"<<endl; sort(vec.begin(),vec.end(),compObj); itr=vec.begin(); while(itr!=vec.end()) { cout<<*itr++<<"t"; } cout << "nnFinished in vectorSort7()" << endl; }
Compile
g++ -g -std=c++2a -I. h1.cpp BSTNode.cpp -o h1 -luuid
Run ./h1
原文链接: https://www.cnblogs.com/Fred1987/p/15787665.html
欢迎关注
微信关注下方公众号,第一时间获取干货硬货;公众号内回复【pdf】免费获取数百本计算机经典书籍;
也有高质量的技术群,里面有嵌入式、搜广推等BAT大佬
原创文章受到原创版权保护。转载请注明出处:https://www.ccppcoding.com/archives/401614
非原创文章文中已经注明原地址,如有侵权,联系删除
关注公众号【高性能架构探索】,第一时间获取最新文章
转载文章受原作者版权保护。转载请注明原作者出处!