Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <chrono>
- #include <thread>
- #include <random>
- #include <algorithm>
- int h(int x, int i, int T)
- {
- if (i == 0)
- return x % T;
- return (h(x, 0, T) + i) % T;
- }
- bool hash_al_wstaw(int *A, int x, int T, int &wywolanie)
- {
- for (int i = 0; i < T; i++)
- {
- wywolanie++;
- int k = h(x, i, T);
- if (A[k] == -1)
- {
- A[k] = x;
- return true;
- }
- }
- return false;
- }
- bool hash_al_szukaj(int *A, int x, int T, int &wywolanie)
- {
- for (int i = 0; i < T; i++)
- {
- wywolanie++;
- int k = h(x, i, T);
- if (A[k] == x)
- return true;
- else if (A[k] == -1)
- return false;
- }
- return false;
- }
- int losowa_liczba(int min = 0, int max = std::numeric_limits<int>::max())
- {
- static std::default_random_engine gen(std::random_device{}());
- static std::uniform_int_distribution<int> dist;
- return dist(gen, std::uniform_int_distribution<int>::param_type{ min, max });
- }
- int* restr(int *tab, int &T, int &wywolanie) {
- int *nowa_tab = new int[2*T];
- for (int i = 0; i < T; i++) {
- if (tab[i] != -1)
- hash_al_wstaw(tab, nowa_tab[i], T, wywolanie);
- }
- T = 2 * T;
- delete[] tab;
- return nowa_tab;
- delete[] nowa_tab;
- }
- bool new_hash_al_wstaw(int *A, int x, int T, int &wywolanie, &zapelnienie)
- {
- for (int i = 0; i < T; i++)
- {
- wywolanie++;
- int k = h(x, i, T);
- if (A[k] == -1)
- {
- A[k] = x;
- return true;
- }
- }
- return false;
- }
- int main()
- {
- const int T = 1048576;
- int *tab_miesz = new int[T];
- for (int i = 0; i < T; i++)
- tab_miesz[i] = -1;
- const int length = 12000000;
- int *tab = new int[length];
- for (int i = 0; i < length; i++)
- tab[i] = i;
- std::random_shuffle(tab, tab + length);
- int wywolanie = 0;
- int procent10 = T / 10;
- int procent = T / 10;
- int zapelnienie = 10;
- for (int i = 0; i < T * 0.9; i++)
- {
- hash_al_wstaw(tab_miesz, tab[i], T, wywolanie);
- if (i == procent)
- {
- wywolanie = 0;
- auto start = std::chrono::high_resolution_clock::now();
- for (int j = 0; j < procent; j += procent / 10000)
- hash_al_szukaj(tab_miesz, tab[j], T, wywolanie);
- auto end = std::chrono::high_resolution_clock::now();
- std::chrono::duration<double, std::micro> duration = end - start;
- std::cerr << zapelnienie << "% " << "Uplynelo: " << duration.count() << "us\n";
- std::cerr << zapelnienie << "% " << "Wywolania: " << wywolanie << "\n" << "\n";
- procent += procent10;
- zapelnienie += 10;
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement