程序代码：

#include <stdio.h>

void sort_MP(int nbrs[],int length);

int main(void){
    int nbrs[] = {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20};
    int length = sizeof(nbrs)/sizeof(*nbrs);

    sort_MP(nbrs,length);

    for(int i = 0; i < length; i++){
        printf("%d \t",nbrs[i]);
    }

    return 0;
}

void sort_MP(int nbrs[],int length){
    int times = 0;
    int index = 0;
    int temp = 0;

    do{
        index = 0;
        times = 0;

        LI:
        if(nbrs[index] < nbrs[index+1]){
            temp = nbrs[index];
            nbrs[index] = nbrs[index+1];
            nbrs[index+1] = temp;
            times++;
        }
        index++;

        if(index < length-1)
            goto LI;

        length--;
    }while(times > 0);
}