Bubble Sort - C++

gistfile1.cpp

template<typename Comparable> void bubbleSort(vector<Comparable> &a);
template<typename Comparable> void bubbleSortInverted(vector<Comparable> &a);


template <typename Comparable>
void bubbleSort(vector<Comparable> &a)
{
	bool sorted = false;
	for(int pass = 1; pass < a.size() && !sorted; pass++)
	{
		sorted = true; // Optimize and stop if array is already sorted
		for(int index = 0; index < a.size() - pass; index++)
		{
			if(a[index] > a[index + 1])
			{
				swap(a[index], a[index + 1]);
				sorted = false;
			}
		}
	}
}

template <typename Comparable>
void bubbleSortInverted(vector<Comparable> &a)
{
	bool sorted = false;
	for(int pass = a.size() - 1; pass > 0 && !sorted; pass--)
	{
		sorted = true; // Optimize and stop if array is already sorted
		for(int index = a.size() - 1; index > 0; index--)
		{
			if(a[index] < a[index - 1])
			{
				swap(a[index], a[index - 1]);
				sorted = false;
			}
		}
	}
}