Question

Run-able,

Corrected source code

The following code will sort an array in descending order. Keep it as Descending. However it has two logic bugs.

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

/*

   The sorting algorithm is to be left as descending

   There are two logical bugs, the number do not sort correctly

   Fix it

   Add analysis output as per requirements

*/

#include <stdio.h>

main()

{

char wait;

short m[]={3,5,7,2,5,1,2,2,

             6,5,7,2,4,1,3,3,

             7,7,3,2,5,7,1,9};

unsigned char temp, i, j;

unsigned char numElements = sizeof(m)/sizeof(m[0])-1;

for (i=0; i<numElements-1; i++)

{

   for(j=i+1; j<numElements; j++)

   {

     if ( m[i] <= m[j])

     {

       temp = m[j];

       m[i] = m[j];

       m[j] = temp;

     }

   }      

}

scanf("%d",&wait); // if you notice this will stop the code waiting for you to input something

// a poor man's breakpoint :)

}

Follow Requirements and Comments in the Code

Comment each loop as to what the loop is performing

/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

Analysis of a Buggered Sort