/*
 *    bubblesort.cpp.cpp
 *
 *    Rusiavimas burbulo metodu.
 *    Lyginame du gretimus skaicius: jei ankstesnis didesnis uz paskesni,
 *    tai sukeiciame juos vietomis.
 *
 */
#include <iostream>
using namespace std;
int main ()
{
    int numbers [] = {0, -1, 2, 7, 3, -9, 20, 5};
    int count      = sizeof(numbers) / sizeof(numbers[0]);
    
    for (int size = count;  size > 1;  size--)
        for (int i = 1;  i < size;  i++)
            if (numbers[i-1] > numbers[i])
            {
                int tmp      = numbers[i-1];
                numbers[i-1] = numbers[i];
                numbers[i]   = tmp;        
            }
            
    for (int i = 0;  i < count;  i++)
        cout << numbers[i] << "  ";
    cout << "\n";
}
