Implement Selection Sort Method using Functions
#include
#include
int findmax(int b[10], int k);
void exchang(int b[10], int k);
void main()
{
int array[10];
int i, j, n, temp;
clrscr();
printf("Enter the value of n \n");
scanf("%d", &n);
printf("Enter the elements one by one \n");
for (i = 0; i < n; i++)
{
scanf("%d", &array[i]);
}
printf("Input array elements \n");
for (i = 0; i < n ; i++)
{
printf("%d\n", array[i]);
}
exchang(array, n);
printf("Sorted array is...\n");
for (i = 0; i < n; i++)
{
printf("%d\n", array[i]);
}
}
int findmax(int b[10], int k)
{
int max = 0, j;
for (j = 1; j <= k; j++)
{
if (b[j] > b[max])
{
max = j;
}
}
return(max);
}
void exchang(int b[10], int k)
{
int temp, big, j;
for (j = k - 1; j >= 1; j--)
{
big = findmax(b, j);
temp = b[big];
b[big] = b[j];
b[j] = temp;
}
return;
getch();
}
Output
Enter the value of n
4
Enter the elements one by one
57
90
34
78
Input array elements
57
90
34
78
Sorted array is...
34
57
78
90
Implement
Insertion Sort
#include
#include
#define max 7
void insertion_sort(int *);
void main()
{
int a[max], i;
clrscr();
printf("enter elements to be sorted:");
for (i = 0;i < max;i++)
{
scanf("%d", &a[i]);
}
insertion_sort(a);
printf("sorted elements:\n");
for (i = 0;i < max; i++)
{
printf(" %d", a[i]);
}
}
void insertion_sort(int * x)
{
int temp, i, j;
for (i = 1;i < max;i++)
{
temp = x[i];
j = i - 1;
while (temp < x[j] && j >= 0)
{
x[j + 1] = x[j];
j = j - 1;
}
x[j + 1] = temp;
}
}
Output
enter elements to be sorted:8 2 4 9 3 6 1
sorted elements:
1 2 3 4 6 8 9
enter elements to be sorted:1 2 3 4 5 6 7
sorted elements:
1 2 3 4 5 6 7
enter elements to be sorted:7 6 5 4 3 2 1
sorted elements:
1 2 3 4 5 6 7
No comments:
Post a Comment