Selection sort

   #include <stdio.h>

main()
{
  int array[100], n, c, d, position, t;

  printf("Enter number of elementsn");
  scanf("%d", &n);

  printf("Enter %d integersn", n);

  for (c = 0; c < n; c++)
    {
        scanf("%d", &array[c]);
    }

  for (c = 0; c < (n - 1); c++) // finding minimum element (n-1) times
  {
    position = c;

    for (d = c + 1; d < n; d++)
    {
      if (array[position] > array[d])
        position = d;
    }
    if (position != c)
    {
      t = array[c];
      array[c] = array[position];
      array[position] = t;
    }
  }

  printf("Sorted list in ascending order:n");

  for (c = 0; c < n; c++)
  {
      printf("%dn", array[c]);
  }
    
getch();
}