template sort function

[firix]

Hi,

I tried to write the sort function for vector <Record>
but I not complete it.
Can you help.

thanks in advance..

class Record{
	int count;
	int price;
	public:
		Record(int price1, int count1 = 0):price(price1),count(count1){}

		friend bool operator>(const Record &r1, const Record &r2);
		friend ostream &operator<<(ostream &os,  const Record &r);
		
	};
	bool operator >(const Record &r1, const Record &r2)
	{
		if (r1.price > r2.price)
			return true;
		else
			return false;

	}

	ostream &operator<<(ostream &os,  const Record &r)
	{

		return os << "(" << r.price << ")" << endl;
	}

	


	
	bool cmp(Record &r1, Record &r2)
	{
		if (r1 > r2)
			return true;
		return false;
	}



template<class Iter, class functor>
void sorts(Iter beg, functor f)
{
		for (int k = 0; k < size -1; k++){
			for (int i = 0; i < size -1 -k; i++)
				if (f(it[i], iter[i + 1]))
			swap(iter[i],iter[i + 1]);
		}
}

[kempofighter]

Why would you do that? Just use std::sort. There is a version of it that takes a functor or predicate and it works for c-arrays and std sequence containers and it will be more efficient than a bubble sort.

[firix]

kempofighter (1070) Dec 15, 2010 at 11:25pm
Why would you do that? Just use std::sort. There is a version of it that takes a functor or predicate and it works for c-arrays and std sequence containers and it will be more efficient than a bubble sort.

I want to write myself.To see how it is

[firix]

I wrote the following.

template<class Iter, class functor>
void sorts(Iter beg, Iter end, functor f)
{  
	int size = end - beg;

	for (int k = 0; k < size -1; k++){
	   for (int i = 0; i < size -1 -k; i++)
	     if (f(beg[i], beg[i + 1]))
	         swap(beg[i],beg[i + 1]);
		
              }
}