/* Program for selection sort recursion process*/

/* program for c */ 

#include<stdio.h>

#include<string.h>

#include<conio.h>

void selectionsort(int [],int);

void main()

            {

            int ar[]={12,54,23,45,6};

            int i;

            printf("Before sort\n");

            for(i=0;i<5;i++)

                        printf("%d\t",ar[i]);

            selectionsort(ar,0);

            printf("\nAfter sort\n");

            for(i=0;i<5;i++)

                        printf("%d\t",ar[i]);

            }

void selectionsort(int array[], int startIndex)

{

    if ( startIndex >= 4 )

            return;

    int minIndex = startIndex;

    for ( int index = startIndex + 1; index < 5; index++ )

    {

            if (array[index] < array[minIndex] )

                minIndex = index;

    }

    int temp = array[startIndex];

    array[startIndex] = array[minIndex];

    array[minIndex] = temp;

    selectionsort(array, startIndex + 1);

}

/* program for java */ 

class selectionsortrecursion

{

public void main()

            {

            int ar[]={12,54,23,45,6};

            int i;

            System.out.print("Before sort\n");

            for(i=0;i<5;i++)

                        System.out.print(ar[i]+"\t");

            selectionsort(ar,0);

            System.out.print("\nAfter sort\n");

            for(i=0;i<5;i++)

                        System.out.print(ar[i]+"\t");

            }

void selectionsort(int array[], int startIndex)

{

    if ( startIndex >= 4 )

            return;

    int minIndex = startIndex;

    for ( int index = startIndex + 1; index < 5; index++ )

    {

            if (array[index] < array[minIndex] )

                minIndex = index;

    }

    int temp = array[startIndex];

    array[startIndex] = array[minIndex];

    array[minIndex] = temp;

    selectionsort(array, startIndex + 1);

}