Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- void bubble_sort(int *tab, int size) {
- int i = -1, j;
- bool if_swap;
- do {
- if_swap = false;
- for (++i, j = size - 1; j > i; --j) {
- if (tab[j] < tab[j - 1]) {
- swap(tab[j], tab[j - 1]);
- if_swap = true;
- }
- }
- } while (if_swap);
- }
- void insert_sort(int *tab, int size) {
- int x;
- for (int j = 1, i; j < size; j++) {
- x = tab[j];
- //wstaw tab[j] w posortowany ciąg tab[0...,j-1]
- for (i = j - 1; i >= 0 && x < tab[i]; --i)
- tab[i + 1] = tab[i];
- tab[i + 1] = x;
- }
- }
- int main() {
- int *tab, size;
- cout << "Podaj z ilu elementow ma skladac sie tablica do posortowania" << endl;
- cin >> size;
- tab = new int[size];
- //wczytywanie liczb
- cout << "Podaj liczby do posortowania" << endl;
- for (int i = 0; i < size; i++)
- cin >> tab[i];
- //bubble_sort(tab, size);
- insert_sort(tab, size);
- //wypisanie posortowanych
- cout << "Posortowana tablica: " << endl;
- for (int i = 0; i < size; i++)
- cout << tab[i] << " ";
- cout << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement