Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //Projektna naloga v kateri bom predstavil hitrost algoritmov za sortiranje. Primerjal bom hitrost in efektivnost naslednjih algoritmov: Bubble sort, Shell sort, Quick sort, Selection sort, Insertion sort, Merge sort in Heap sort.
- #include <iostream>
- #include <cstdlib>
- using namespace std;
- //Funkcije
- int main()
- {
- srand(time(NULL));
- int nakljucna_stevila[20];
- cout << "Generiram 20 naključnih števil od 0 in do 10.000\n...................................................................................\n";
- for (int i=0;i<20;i++)
- nakljucna_stevila[i]=rand()% 10000;
- cout << "\nZgeneriral sem naslednja števila: ";
- int i=0;
- for (i=0;i<20-1;i++)
- cout << nakljucna_stevila[i] << ", ";
- cout << nakljucna_stevila[19];
- cout << "\n";
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement