Help with sorting elements from lowest to highest

[RICEFREAK]

hi guys, I need help sorting out the elements from lowest to highest. But, it seems that it sorts it out from highest to lowest.

const unsigned a [] = {300,4,6,1,5,600,2,800};

void sort ( unsigned a[], unsigned size)
{

unsigned compare;
unsigned answer;
unsigned k;

printf("[");

for (; 0 < size; size--)
{
	printf(" %u,", a[size-1]);
	
	for (compare = 1; compare <= size; compare++)
	{
	
		
		if (a[compare - 1] > a[compare])
		{
		
		answer = a[compare - 1];
		a[compare - 1] = a [compare];
		a[compare] = answer;
		
		

		}


	}


}
printf("]\n");

}

/*OUTPUT
[ 800, 600, 300, 6, 5, 4, 2, 1,]
*/

[Intrexa]

Well, line 21 is the line where you check to see which is larger. Anything you change to fix this issue is going to revolve around that line.

[Ben Duncan]

Urgh, C, what a silly language.

Anyway, think about what you have to do. *cough* Reversal *cough*.
Intrexa is right, that one line is the key.

[RICEFREAK]

I still don't get it :(

[Albatross]

Perhaps you should have used a different operator? You know, the one that looks similar to the one you're using but does almost the exact opposite thing?

-Albatross