Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "stdafx.h"
- #include <iostream>
- #include <assert.h>
- #include <string.h>
- #include <ctime>
- #include <algorithm>
- using namespace std;
- void sort_babelkowe(int tab[], int n){
- for (int i = 0; i < n; i++){
- for (int j = 1; j < n - 1; j++){//petla wewnetrzna
- if (tab[j - 1]>tab[j])
- swap(tab[j - 1], tab[j]);//zamiania miejscami
- }
- }
- }
- int main(){
- int *tab, n;
- cout << "podaj ilosc liczba do sotrowania: ";
- cin >> n;
- //alokowanie pamieci
- tab = new int[n];
- srand(time(NULL));
- cout << "Emenety wylosowane:\n";
- for (int i = 0; i < n; i++){
- tab[i] = (rand() % 200) - 100;
- cout << tab[i] << " ";
- }
- sort_babelkowe(tab, n);
- //wypisanie elementow tablicy:
- cout << "\n\nEmenety posortowane:\n";
- for (int i = 0; i < n; i++){
- cout << tab[i] << " ";
- }
- delete[] tab;
- system("pause");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement