template<class T>
class insertion_sort:public sort<T>
{
public:
	insertion_sort(int t):sort<T>(t){};
	
	void execute()
	{
		int key,j;
		for(int i=1; i<tam; i++)
		{
			key = pvec[i];
			j = i-1;
			n_pasadas++;
			while(j>=0 && pvec[j] > key)
			{
				
				pvec[j+1] = pvec[j];
				j = j-1;
				n_intercambios++;
			}
			pvec[j+1] = key;

		}
	}
};