60 lines
1.3 KiB
C
60 lines
1.3 KiB
C
|
/*
|
||
|
|
* C Program to Implement Selection Sort Recursively
|
||
|
|
*/
|
||
|
|
#include <stdio.h>
|
||
|
|
|
||
|
|
void selection(int [], int, int, int, int);
|
||
|
|
|
||
|
|
int main()
|
||
|
|
{
|
||
|
|
int list[30], size, temp, i, j;
|
||
|
|
printf("Enter the size of the list: ");
|
||
|
|
scanf("%d", &size);
|
||
|
|
printf("Enter the elements in list:\n");
|
||
|
|
for (i = 0; i < size; i++)
|
||
|
|
{
|
||
|
|
scanf("%d", &list[i]);
|
||
|
|
}
|
||
|
|
selection(list, 0, 0, size, 1);
|
||
|
|
printf("The sorted list in ascending order is\n");
|
||
|
|
for (i = 0; i < size; i++)
|
||
|
|
{
|
||
|
|
printf("%d ", list[i]);
|
||
|
|
}
|
||
|
|
return 0;
|
||
|
|
}
|
||
|
|
|
||
|
|
void selection(int list[], int i, int j, int size, int flag)
|
||
|
|
{
|
||
|
|
int temp;
|
||
|
|
if (i < size - 1)
|
||
|
|
{
|
||
|
|
if (flag)
|
||
|
|
{
|
||
|
|
j = i + 1;
|
||
|
|
}
|
||
|
|
if (j < size)
|
||
|
|
{
|
||
|
|
if (list[i] > list[j])
|
||
|
|
{
|
||
|
|
temp = list[i];
|
||
|
|
list[i] = list[j];
|
||
|
|
list[j] = temp;
|
||
|
|
}
|
||
|
|
selection(list, i, j + 1, size, 0);
|
||
|
|
}
|
||
|
|
selection(list, i + 1, 0, size, 1);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
/*
|
||
|
|
*OUTPUT:
|
||
|
|
Enter the size of the list: 5
|
||
|
|
Enter the elements in list:
|
||
|
|
23
|
||
|
|
45
|
||
|
|
64
|
||
|
|
12
|
||
|
|
34
|
||
|
|
The sorted list in ascending order is
|
||
|
|
12 23 34 45 64
|
||
|
|
*/
|