#include <stdio.h>
int a[10]={6,2,8,10,5,1,7,3,4,9};
int cc=0,mm=0;

int findmax(int low, int high) {
  int large=low, i;

  for (i=low+1; i <= high; i++) {
    cc++;
    if (a[large] <=a[i]) large=i;
  }
  return large;
}

void selectsort() {
  int i,t,maxpos;

  for (i=9; i>0; i--) {
    maxpos=findmax(0,i);
    t=a[i]; a[i]=a[maxpos]; a[maxpos]=t; mm++;
  }
}

void main() {
 int i,j;

 clrscr();
 printf("original order --> \n");
 for (i=0; i<10; i++) printf("%2d ",a[i]);

 selectsort();
 printf("\nsorted order --> cc=%d mm=%d\n",cc,mm);
 for (i=0; i<10; i++) printf("%2d ",a[i]);
}