assembleur de mort

// mettez dans la section .data:
int SIZE = 9;

int array[9] = { 2, 6, 3, 8, 5, 4, 1, 9, 7 };
// impl ́ementez la fonction r ́ecursivevoid
quicksort(int *target, int left, int right) {if(left >= right) return;
int i = left, j = right;
int pivot = target[i];
while(i<j) {int tmpi=target[i];
            while(tmpi < pivot){
                i=i+1;
                tmpi=target[i];
}
            int tmpj=target[j];
            while(pivot < tmpj){
                j=j-1;
                tmpj=target[j];
                               }
            if(i < j){

                target[i] = tmpj;
                target[j] = tmpi;
                i=i+1;j=j-1;
            }
}
quicksort(target, left, i-1);
quicksort(target, j+1, right);
}

int main(int argc, char **argv){
// appeller la fonction
    quicksort(array, 0, SIZE-1);
// boucle terminale "b ."
    while(1){};
}