Chapter D, Problem D.5E

(Recursive Selection Sort) A selection sort searches an array looking for the smallest element in the array. When that element is found, it’s swapped with the first element of the array. The process is then repeated for the subarray, beginning with the second element. Each pass of the array results in one element being placed in its proper location. This sort requires processing capabilities similar to those of the bubble sort—for an array of n elements, $n-1$ passes must be made, and for each subarray, $n-1$ comparisons must be made to find the smallest value. When the subarray being processed contains one element, the array is sorted. Write a recursive function selectionsort to perform this algorithm.

Program Plan Intro

Program Plan-

• Define Header files.
• Define selectionSort()function.
• Define local variables.
• Checking the condition using for() loop till the iteration i is less than 6.
• Display result.
• Checking the condition using if-else() loop.
• Checking the second element with first element.
• Declare main() function.
• Declare local variable.
• Checking the condition using for() loop till the iteration i is less than 6
• Calling selectionSort() function.
• Return successfully to main().

Summary Introduction- (Recursive Selection Sort)A selection sort searches an array looking for the smallest element in the array. When the element is found, it is swapped with the first element of the array. The process is repeated for the sub-array beginning with the second element of the array. Each pass of the array results in one element being placed in its proper location. This sort requires processing capabilities similar to those of bubble sort.

Program Description- The purpose of the program is to implement the recursive selection sort.

Explanation of Solution

Modified program:

/*
 *This program to implement the recursive selection sort.
*/

#include<stdio.h>

//recursive definition for selcetion sort
void selectionSort ( int a[], int size, int i, int j)
{
    //declare local variable
    int temp;
    //checking the condtion using if-else loop
    if(i==size)
    {
        //iteration gets executed till value of i is less than 6
        for(i=0; i<6; i++)

            //Displaying result
            printf("%d ",a[i]);
        return; //return successfully
    }
    else
    {
        //checking the condition using if-else() loop
        if(j<size)
        {
//checking the second element with first //element
            if(a[i]>a[j])
            {
                temp=a[i];
                a[i]=a[j];
                a[j]=temp;
            }

//function call
//calling function with parameters
            selectionSort(a,size,i,j+1);
        }

        else
        {
//function call
            selectionSort(a,size,i+1,i+1);
        }
    }
}
//Define main() function
int main(int argc, char *argv[])
{
//Declare local variables
    int arr[6],i,min,j,temp;
    printf("Enter the elements of array\n");

//Asking user to enter elements
//Executing for() loop
    for (i=0; i<6; i++)
    {
        printf("Element %d: ",i+1);
        scanf("%d",&arr[i]);
    }
//sorting the value
    selectionSort(arr,6,0,1);

    return 0; //return successfully
}

Sample Output-

Sample Output:

Enter the element of array

Element 1:37

Element 2:2

Element 3:6

Element 4:4

Element 5:89

Element 6:8

2 4 6 8 37 89