// -----------------
//

#include <stdio.h>
#include <stdlib.h>
#include <math.h>

#include<iostream.h>
#include"string.h"
void straightInsertion(int n, float a[]);
void straightExchange(int n, float a[]);
void straightSelection(int n, float a[]);
void dump(char * str, int n, float a[]);
void shufle(int ind_case, int n, float a[]);
void shakesort(int n, float a[]);
void quicksort(int n, float a[]);
void binaryInsertion(int n, float a[]);

//---------------
int main()
{

	

	int ifNextFormula; 
	int n;
	int ind_case;
	float a[30];
	float x;
	a[0]=999;
	a[1]=21;
	a[2]=5;
	a[3]=37;
	a[4]=2;
	//n=4;
	//ind_case=1;
	n=8;
	ind_case=2; //second example.
	n=8;
    // ind_case=3; // Random Number shufle.
    ind_case=4;    // Small numbers.

	// the elements of the array that should be considered in the sorting are:
	// a[1]...a[n].  the a[0] is an auxiliary one.

	shufle(ind_case,n, a);
	straightInsertion(n, a);
	dump("Insertion",n, a);
	shufle(ind_case,n, a);
	straightSelection(n, a);
	dump("Selection", n, a);
	shufle(ind_case,n, a);
	straightExchange(n, a);
	dump("Exchange",n, a);
	shufle(ind_case,n, a);
	shakesort(n, a);
	dump("Shake-Sort",n, a);
	shufle(ind_case,n, a);
	quicksort(n, a);
	dump("quicksort",n, a);
    shufle(ind_case,n, a);
	binaryInsertion(n, a);
	dump("binaryInsertion",n, a);
    x=17;
// =================================
	cout << " Give Next Option(1,0) (y,n) " << endl;
	cin >> ifNextFormula ;
    cout << "===========================" << endl;
   //

      
return 3;
}