Sorting.cpp

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

using namespace std;

class Test {
	int id;
	string name;

public:
	Test(int id, string name) : id(id), name(name) {
	}

	void print() const {
		cout << id << ": " << name << endl;
	}

	/*bool operator<(const Test &other) const {
		return name < other.name;
	}*/

	friend bool comp(const Test &a, const Test &b);
};

bool comp(const Test &a, const Test &b) {
	return a.name < b.name;
}

int _main11(int argc, _TCHAR* argv[]) {
	vector<Test> tests;

	tests.push_back(Test(5, "Mike"));
	tests.push_back(Test(10, "Sue"));
	tests.push_back(Test(7, "Raj"));
	tests.push_back(Test(5, "Vicky"));

	sort(tests.begin(), tests.end(), comp);

	for(int i = 0; i < tests.size(); i++) {
		tests[i].print();
	}

	return 0;
}