Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // Algorytmy i Struktury Danych
- //
- // Robert Kwiatkowski
- #include <iostream>
- #include <stdio.h>
- #include <string.h>
- #include <ctype.h>
- #include <stdlib.h>
- #include <time.h>
- #include <vector>
- int hash(int k){
- return k % 3;
- }
- void WstawAOL(int k, std::vector<int>& tablica, int N){
- int poz, i;
- poz = hash(k);
- i = 0;
- while (i < N && tablica[poz]) {
- if (tablica[poz] == k) {
- return;
- }
- i += 1;
- poz = (poz + 1) % N;
- }
- if (i == N) {
- return;
- }
- tablica[poz] = k;
- }
- int main(){
- srand( time( NULL ) );
- //int tablica[88];
- std::vector<int> tablica;
- tablica.resize(88 , 0);
- for(int i = 0; i < 100; i++){
- int wylosowana_liczba =(rand() % 10 ) + 7;
- WstawAOL(wylosowana_liczba, tablica, i);
- }
- for (size_t i = 0; i < /*sizeof(tablica)/sizeof(int)*/ tablica.size(); i++) {
- printf("%i|",tablica[i]);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement