#include <stdio.h>

int Liste[10]={5,3,2,8,12,1,32,-4,7};

void inversion(int n) {
    int temp=Liste[n];
    Liste[n] = Liste[n+1];
    Liste[n+1] = temp;
}

int main() {
    int i,n=10;
    while (n-- != 1) {
        for (i=0;i<n;i++) {
            if (Liste[i]>Liste[i+1])
                inversion(i);
        }
    }
    for (i=0;i<10;i++)
        printf(" %d -",Liste[i]);
}

Embed on website

To embed this project on your website, copy the following code and paste it into your website's HTML: