bubblesort

#include<iostream>

using namespace std;

void babelkowe(int n, int *tab) {
    int i = 0, j, x;

    for (i; i < n; i++) {
        for (j = n; j > i; j--) {
            if (tab[j-1] > tab[j]) {
                x = tab[j-1];
                tab[j-1] = tab[j];
                tab[j] = x;
            }
        }
    }
}

void mieszane(int n, int *tab) {
    int j, l = 0, k = n, p = n, x;

    do {
        for (j = p; j > l; j--) {
            if (tab[j-1] > tab[j]) {
                x = tab[j-1];
                tab[j-1] = tab[j];
                tab[j] = x;
                k = j;
            }
        }
        l = k + 1;
        for (j = l; j < p; j++) {
            if (tab[j-1] > tab[j]) {
                x = tab[j-1];
                tab[j-1] = tab[j];
                tab[j] = x;
                k = j;
            }
        }
        p = k - 1;
    } while (l > p);
}

void shell(int n, int *tab) {
  int t = n/2;
  int i,j,k;
  while(t >= 1) {
    for (i = t; i < n; i += 1) {
      k = tab[i];
      for (j = i; j >= t && tab[j - t] > k; j -= t)
        tab[j] = tab[j - t];
      tab[j] = k;
    }
    t=t/2;
  }
}


int main() {
    int n = 10;

    int tab[n] = {10, 6, 22, 10, 21, 4, -5, 9, 8, 1};

    mieszane(n, tab);

    cout<<"\nElementy posortowane:\n";
    for(int i=0; i<n; i++)
            cout<<tab[i]<<" ";

    return 0;
}