//**************************************
//     
// Name: SHAKER SORT
// Description:This code is used to sort
//     an array of integers.
The algorithm used is SHAKER SORT. this is an improvement to the bubble sort.
// By: Renjini S
//
// Inputs:Array elements
//
// Returns:Sorted Array
//
// Assumes:/*
SHAKER SORT
this is an improvement to the bubble sort.
Instead of always reading the array in the same
direction,alternate passes could reverse
direction.In this way,greatly out-of-place
elements travel quickly to the correct position.
It is called "Shaker sort" because it imparts
the effect of a shaking motion to the array.
Although the shaker sort improves the bubble 
sort, it still executes on the order of an
n-squared algorithm.
*/
//
//This code is copyrighted and has// limited warranties.Please see http://
//     www.Planet-Source-Code.com/vb/scripts/Sh
//     owCode.asp?txtCodeId=7165&lngWId;=3//for details.//**************************************
//     

#include <stdio.h>
#define ARRAYSIZE 10
void shaker(int *,int);
void main()
    {
    int i,a[ARRAYSIZE];
    printf("Enter the array elements\n");
    for(i=0;i<ARRAYSIZE;i++)
    scanf("%d",&a;[i]);
    shaker(a,ARRAYSIZE);
    printf("Sorted array\n");
    for(i=0;i<ARRAYSIZE;i++)
    printf(" %d",a[i]);
    printf("\n");
}

void shaker(int *a,int n)
    {
    int i;
    int exchange;
    int t;
    do
        {
        exchange=0;
        for(i=n-1;i>0;--i)
            {
            if(a[i-1]>a[i])
                {
                t=a[i-1];
                a[i-1]=a[i];
                a[i]=t;
                exchange=1;
            }

        }

        for(i=1;i<n;++i)
            {
            if(a[i-1]>a[i])
                {
                t=a[i-1];
                a[i-1]=a[i];
                a[i]=t;
                exchange=1;
            }

        }

    }while(exchange);

}