source: Deliverables/D2.2/8051/tests/clight/testCOMP_tri.c

void tri (int t[], int n) {
        int i,j,tmp;
        tmp = 0; 

        for(i = 0 ;i < n; i=i+1)
        {
                for(j = 1 ; j < n-i ; j=j+1)
                {
                        if(t[j] < t[j-1])
                        {
                                tmp = t[j-1];
                                t[j-1] = t[j];
                                t[j] = tmp;
                        }
                }
        }
}

int main(){
        int t[10] = {10,9,8,7,6,5,4,3,2,1};
        tri(t,10);
        return t[0];
}