#include "Fraction.h"

template <class T>
struct Fraction {
	T num, denom;  //num - Numerator ; demon-Denominator
};
template <class T>
void inputFraction(Fraction<T> a[], int& n) {
	cout << "Enter n:"; //number of Fractions
	cin >> n;

	for (int i = 0;i < n;i++) {
		cout << "Enter Numerator:";
		cin >> a[i].num;
		cout << "Enter Denominator:";
		cin >> a[i].denom;
	}
}

template <class T>
bool compareFractionsAscending(Fraction<T> a, Fraction<T> b)  //Compare fraction a > b 
{
	T num1 = a.num;
	T denom1 = a.denom;
	T num2 = b.num;
	T denom2 = b.denom;

	T result = (num1 * denom2) - (num2 * denom1);
	return (result > 0) ? true : false;
}

template <class T>
bool compareFractionsDescending(Fraction<T> a, Fraction<T> b) //Compare fraction a < b
{
	T num1 = a.num;
	T denom1 = a.denom;
	T num2 = b.num;
	T denom2 = b.denom;

	T result = (num1 * denom2) - (num2 * denom1);
	return (result < 0) ? true : false;
}


template <class T>
void swapFraction(Fraction<T>& a, Fraction<T>& b)            //Change seat two fractions
{
	Fraction<T> temp = a;
	a = b;
	b = temp;
}

template <class T>
void printArrayFraction(Fraction<T> a[], int n)
{
	for (int i = 0;i < n;i++) {
		cout << a[i].num << " / " << a[i].denom << endl;
	}
}

template <class T>
void sortArrayFraction(Fraction<T> a[], int n, bool (*compareFractions)(Fraction<T>, Fraction<T>))
{
	for (int i = 0;i < n;i++) {
		for (int j = i + 1;j < n;j++) {
			if (compareFractions(a[i], a[j]))   //Function pointer compare (Descending or Ascending)
				swapFraction(a[i], a[j]);       // if true then swap two fractions 
		}
	}
}