Thread: manually sorting cards

Originally Posted by brewbuck

Direct placement sort. Draw 100 squares on the ground, labeled 1-100. For each card, place it on the matching square. Now pick them up in order. (This is a special case of rank sort)

Even more efficient, don't sort the cards at all, but merely imagine that they are sorted.

Hmm

Code:

int* DPSort(int *Data)
{
	int Table[100];
	int SortedData[100];
	unsigned int i = 0;
	for(; i < 100; i++)
	{
		Table[i] = i+1;
	}
	
	for(i = 0; i < 100; i++)
	{
		for(unsigned int j = 0; j < 100; j++)
		{
			if(Data[i] == Table[j])
			{
				SortedData[j] = Data[i];
				break;
			}
		}
	}
	
	return SortedData;
}

Something tells me this will be very inefficient?

Edit: Ready to flame the first one to comment my poor code!