#include<iostream>
using namespace std;
int n,i,a[9999];
void selectionSort(int x[], int n) {
    for (int pass=0; pass<n-1; pass++) {
        int potentialSmallest = pass;  // assume this is smallest

        //--- Look over remaining elements to find smallest.
        for (int i=pass+1; i<n; i++) {
            if (x[i] < x[potentialSmallest]) {
                //--- Remember index for latter swap.
                potentialSmallest = i;
            }
        }
        
        //--- Swap smallest remaining element
        int temp = x[pass];
        x[pass] = x[potentialSmallest];
        x[potentialSmallest] = temp;
    }
}

main(){
	cin>>n;
	for(i=n;i;)cin>>a[--i];
	selectionSort(a,n);
	cout<<a[n>>1];
}

• Re:sort (515) azma 2009-03-16 16:19:13
  • Re:sort (379) azma 2009-03-16 16:35:17
    • Re:sort (593) azma 2009-03-16 16:47:42
• Re:sort (800) Marziyeh 2009-03-16 16:40:04