/*    usort.c - Insertion Sort   */
/*    JWD, 10/31/2024            */
/*    www.netzener.net           */

#include "stdio.h"

int a[10] = {9, 3, 12, 5, 1, 4, 99, 2, 31, 8};

void print_array ();

void main ()
{
   int i, j, key;

   print_array ();

   printf ("\nDescending Sort...\n\n");

   for (i = 1; i < 10; i++)
   {
      key = a[i];

      j = i - 1;

      while (j >= 0 && a[j] < key)
      {
         a[j + 1] = a[j];
         --j;
      }

      a[j + 1] = key;
   }

   print_array ();
}

void print_array ()
{
   int i;

   printf ("array elements:\n");

   for (i = 0; i < 9; ++i)
      printf ("%d, ", a[i]);

   printf ("%d\n", a[9]);
}