main.cpp

Gyors rendezes(QS) futasi ido pelda

#include "qs.h"

#define meret 6

using namespace std;


/*********************************************************
*	MAIN
*********************************************************/


int main()
{
	Q_S<Node> q;
	Node* t = new Node[meret];

	t[1].ev = 5;
	t[1].terfogat = 2000;
	t[1].fogyaszt = 10;
	t[1].ar = 300000;
	t[1].marka = "skoda";

	t[2].ev = 10;
	t[2].terfogat = 1000;
	t[2].fogyaszt = 70;
	t[2].ar = 80000;
	t[2].marka = "suzuki";

	t[3].ev = 1;
	t[3].terfogat = 4000;
	t[3].fogyaszt = 13;
	t[3].ar = 2000000;
	t[3].marka = "rover";

	t[4].ev = 3;
	t[4].terfogat = 1500;
	t[4].fogyaszt = 8;
	t[4].ar = 500000;
	t[4].marka = "seat";

	t[5].ev = 30;
	t[5].terfogat = 1100;
	t[5].fogyaszt = 7;
	t[5].ar = 15000;
	t[5].marka = "skoda";

	t[0].ev = 1;
	t[0].terfogat = 3500;
	t[0].fogyaszt = 10;
	t[0].ar = 1500000;
	t[0].marka = "bmw";
	
	op = 4;

	for (int i = 0; i < meret; ++i)
	{
		cout<< t[i] << endl;
	}
	q.Quick_sort(t, meret-1);

	cout<< endl << "--------------------------------------------------------" << endl;
	for (int i = 0; i < meret; ++i)
	{
		cout<< t[i] << endl;
	}

	cout<< endl << "--------------------------------------------------------" << endl;

	system("pause");
}