Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- void quicksort(long *tablica, long p, long q)
- {
- long v = tablica[(p + q) / 2];
- long i, j;
- i = p;
- j = q;
- do{
- while (tablica[i]<v) i++;
- while (tablica[j]>v) j--;
- if (i <= j){
- swap(tablica[i], tablica[j]);
- i++; j--;
- }
- } while (i <= j);
- if (j>p) quicksort(tablica, p, j);
- if (i<q) quicksort(tablica, i, q);
- }
- int main()
- {
- long z, n;
- fstream plik;
- plik.open("dane.txt");
- plik >> z;
- cout << z << endl;
- for (int i = 0; i < z; i++)
- {
- plik >> n;
- cout << n << endl;
- long *T = new long[n];
- for (int j = 0; j < n; j++)
- {
- plik >> T[j];
- cout << T[j];
- }
- cout << endl;
- }
- plik.clear();
- plik.seekg(0);
- plik >> z;
- for (int i = 0; i < z; i++)
- {
- plik >> n;
- long *T = new long[n];
- quicksort(T, 0, n - 1);
- for (int j = 0; j < n; j++)
- {
- plik >> T[j];
- cout << T[j];
- }
- cout << endl;
- }
- getchar();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement