#ifndef __CHECK_ORDER__
#define __CHECK_ORDER__

#include "Demo.h"

template <typename T> struct CheckOrder {
	T pred;
	int& u;
	CheckOrder(int& unsorted, T& first):pred(first), u(unsorted) { }
	virtual void operator()(T& e) {
		if (pred > e) {
			u++;
			pred = e;
		}
	}
};


template <typename T>
void checkOrder(Demo<T>& D) {
	int unsorted =0;
	D.traverse(CheckOrder<T>(unsorted, D[0]));
	if (0 < unsorted) {
		printf("Unsorted with %d adjacent disordered pair(s)\n", unsorted);
	} else
		printf("Sorted\n");
}

#endif