hashing_practise.cpp

#include <bits/stdc++.h>
using namespace std;
    int arr[11] = {0};
    int size = 0;
    int rehash1 = 3;

    int hasha(int a){
        return a%11;;
    }
    int rehasha(int a){
        return (a%11)+rehash1;
    }
        void insert1(int x){
            if(size==11){
                cout<<"FULL"<<endl;
            }
            int hashNum = hasha(x);
            while(arr[hashNum] != 0){
                hashNum = rehasha(hashNum);
            }
            arr[hashNum] = x;
            size++;
        }
        
    void search(int x){
        int key = x%11;
        int indx;
        for(int i=0; i<11; i++){
            indx = key+i;
            if(arr[indx]==x){
                cout<<"Fount it."<<endl;
                break;
            }
            if(i==10){
                cout<<"Item not Found"<<endl;
            }
        }
    }

    void print(){
        for(int i=0;i<11;i++){
            cout<<arr[i]<<" ";
        }
        cout<<endl;
    }

int main(){
    int q;
    for(int i=0;i<11;i++){
        cin>>q;
        insert1(q);
    }
    print();
    search(31);



    return 0;
}