Selection Sort - Online Code

Description

This is a Code to implement the Selection Sort Algorithnm for a given set of numbers.

Source Code

#include <iostream.h>

void selectionSort(int *array,int length)		//selection sort function
{
	int i,j,min,minat;
	for(i=0;i<(length-1);i++)
	{
		minat=i;
		min=array[i];
		for(j=i+1;j<(length);j++) 		//select the m
... (login or register to view full code)

To view full code, you must Login or Register, its FREE.

Hey, registering yourself just takes less than a minute and opens up a whole new GetGyan experience.




Comments

No comment yet. Be the first to post a comment.