C++ Programming Code for Selection Sort.

C++ Programming Code for Selection Sort.

Selection Sort

/* C++ Program - Selection Sort */		

#include<iostream.h>
#include<conio.h>
void main()
{
	clrscr();
	int size, arr[50], i, j, temp;
	cout<<"Enter Array Size : ";
	cin>>size;
	cout<<"Enter Array Elements : ";
	for(i=0; i<size; i++)
	{
		cin>>arr[i];
	}
	cout<<"Sorting array using selection sort...\n";
	for(i=0; i<size; i++)
	{
		for(j=i+1; j<size; j++)
		{
			if(arr[i]>arr[j])
			{
				temp=arr[i];
				arr[i]=arr[j];
				arr[j]=temp;
			}
		}
	}
	cout<<"Now the Array after sorting is :\n";
	for(i=0; i<size; i++)
	{
		cout<<arr[i]<<" ";
	}
	getch();
}

Output:-

C Program to Sort an Array using SELECTION SORT




#include <stdio.h>

void selection_sort();

int a[30], n;

void main()

{

    int i;

    printf("\nEnter size of an array: ");

    scanf("%d", &n);

    printf("\nEnter elements of an array:\n");

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

        scanf("%d", &a[i]);

    selection_sort();

    printf("\n\nAfter sorting:\n");

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

        printf("\n%d", a[i]);

    getch();

}

void selection_sort()

{

    int i, j, min, temp;

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

    {

        min = i;

        for (j=i+1; j<n; j++)

        {

            if (a[j] < a[min])

                min = j;

        }

        temp = a[i];

        a[i] = a[min];

        a[min] = temp;

    }

}




Expected Output:

Enter size of an array: 8

Enter elements of an array:

68 45 78 14 25 65 55 44

After sorting:

14

25

44

45

55

65

68

78