Welcome to the Lounge

S(a, m); // Solution in a[0..n-1]

S(a) # Solution in a[0..n-1]

// Setup
int n = 2;
int[] m = { 3, 5, 7, 1, 8, 4, 2 };
int[] smallest = (int[])Array.CreateInstance(typeof(int), n);

// My answer
Array.Sort(m); Array.ConstrainedCopy(m, 0, smallest, 0, n);

function reduceTo(arr,n){

	if (n==arr.length) return arr;
	var next=Array();
		
	for (i=0,max=0; i<arr.length; i++){
		if (arr[i]>=arr[max]) {
			if (max!=i) next[next.length]=arr[max];
			max=i;
		}
		else{
			next[next.length]=arr[i];
		}
	}

	return reduceTo(next,n);
}

#include<malloc.h>
int*f(int*s,int m,int n){int i,c,*a=(int*)malloc(n*sizeof(int));for(;n;m--,s++){for(i=1,c=0;i<m;i++)if(s[i]<=*s)c++;if(c<n)a[--n]=*s;}return a;}

#include<malloc.h>
#define D double
D*f(D*s,int m,int n){int i,c;D*a=(D*)malloc(n*sizeof(D));for(;n;m--,s++){for(i=1,c=0;i<m;i++)if(fabs(s[i])<=fabs(*s))c++;if(c<n)a[--n]=*s;}return a;}

#include<malloc.h>
#include<math.h>
int*f(int*s,int m,int n){int i,c,*a=(int*)malloc(n*sizeof(int));for(;n;m--,s++){for(i=1,c=0;i<m;i++)if(fabs(s[i])<=fabs(*s))c++;if(c<n)a[--n]=*s;}return a;}

void g(int a[], int m)
{
	for (int s, p; p= --m;)
		while (p--)
			if (s= a[m], a[p] > s)
				a[m]= a[p], a[p]= s;
}

void g(int*a,int m){for(int s,p;p=--m;)while(p--)if(s=a[m],a[p]>s)a[m]=a[p],a[p]=s;}

void g(int*a,int m){for(int s,p;p=--m;)while(p--)if(s=a[m],a[p]>s)a[m]=a[p],a[p]=s;}

void g(int*a,int m){for(int s,p=0;p--||(p=--m);)if(s=a[m],a[p]>s)a[m]=a[p],a[p]=s;}

Nagy Vilmos wrote:

Not until you come over to the brown and crunchy side.

Dalek Dave wrote:

but you must always smile and think "What a Wanker!" when you see them do these pathetic little things.