What is wrong with my selection sort function?

[musique]

What is wrong with my selection sort function? I am trying everything.

void sort(int array[], int numts)
{
	int lowIndex, lowest;

	for (int count = 0; count < (numts-1); count++)
	{
		lowIndex = count;
		lowest = array[count];
		
		for (int index = count + 1; index < numts; index++)
		{
			if (array[index] < lowest)
			{
				lowest = array[index];
				lowIndex = index;
			}
		}
		array[lowIndex] = array[count];
		array[count] = lowest;


	}
	return;
}

[helios]

Compare what you're doing to the selection sort algorithm:
for i=0 to n-2{
find the lowest value in array[i;n-1]
if i!=lowestIndex
swap array[i] with array[lowestIndex]
}

[musique]

Thanks for the help but I am not very versed in it so I don't fully understand. I am a little confused. Three questions:

1) What do you mean by n-2?

2) What do you mean by [i;n-1]?

3) Do you have an example of a swap function so I could see?

[musique]

Something like this?

void selectionSort(int array[], int numts) 
{
      int index, lowIndex, lowest;    

      for (int count = 0; count < numts - 1; count++) 
	  {
            lowIndex = count;

            for (index = count + 1; index < numts; index++)
			{
                  if (array[index] < array[lowIndex])

                        lowIndex = index;
			}

            if (lowIndex != count) 
			{

                  lowest = array[count];

                  array[count] = array[lowIndex];

                  array[lowIndex] = lowest;
			}

      }

If so, why is this not working?