#include <stdio.h>
#include <stdlib.h>


struct person
{
	char name;
	int nFriends;
	
};

struct person Network[6];



int main()
{
	int i,j;

	Network[0].name = 'a';
	Network[0].nFriends = 3;
		
	Network[1].name = 'b';
	Network[1].nFriends = 2;

	Network[2].name = 'c';
	Network[2].nFriends = 1;

	Network[3].name = 'd';
	Network[3].nFriends = 5;

	Network[4].name = 'e';
	Network[4].nFriends = 6;

	Network[5].name = 'f';
	Network[5].nFriends = 1;


	for(i=0; i<3; i++)   // Run selection sort for 3 iterations
	{
		int maxIndex=i;
		for(j=i; j<6; j++)
		{
			// find the maximum
			if(Network[j].nFriends>Network[maxIndex].nFriends)
				maxIndex=j;
		}		
		// swap them
		struct person temp= Network[i];
		Network[i] = Network[maxIndex];
		Network[maxIndex] = temp;

		
		printf("Person %c has %d friends.\n", Network[i].name, Network[i].nFriends);
	}
	printf("\n");

	system("pause");
}