#ifndef SORTS_H
#define SORTS_H
#include <iostream.h>
// swap template by reference
template <class T> void Swap(T& a,T& b);
// bubble sort swaps between each pair if top is greater than down in pair
// so that at the end of one over the smallest is on top
// then the top is goes down one step 
//not the most efficient bubble sort
template <class X> void Bubble( X *data,int size );
// the most efficient bubble sort
template <class X> void BubbleSort( X *data,int size );
// Esort is like selection sort but less efficient (more Swaps he does)
//Don't use it !
template <class X> void ExchangeSort(X *data,int size);
// it is like when you try to sort cards
template <class T> void InsertionSort(T *data,int size);
//compares the top with all others members ,when finds minimum swaps  between
//minimum  and top  then top goes one step down .
template <class T> void SelectionSort(T* data,int size);
#endif