Need some help with the following hashing algorithm, I can\'t figure it out. Tha

Question

Need some help with the following hashing algorithm, I can't figure it out. Thanks in advance

Let Q and R be the quotient and remainder obtained by dividing K by TSize, and let the probing sequence be created by the following recursive formula:

Explanation / Answer

#include #include #include struct node { int info; struct node *link; }; typedef struct node *NODE; NODE getnode() { NODE x; x=(NODE)malloc(sizeof(node)); if(x==NULL) { printf("out of memory "); exit(0); } return x; } NODE insert(int item,NODE first) { NODE temp,prev,cur; temp=getnode(); temp->info=item; temp->link=NULL; if(first==NULL) return temp; if(iteminfo) { temp->link=first; return temp; } prev=NULL; cur=first; while(cur!=NULL && item>cur->info) { prev=cur; cur=cur->link; } prev->link=temp; temp->link=cur; return first; } int hash(int a[],int n) { int big,i; big=a[0]; for(i=0;ibig) big=a[i]; } i=log10(big); return pow(10,i); } void hash_sort(int a[],int n) { NODE b[10],temp; int i,j,digit,hash_value; hash_value=hash(a,n); for(i=0;i

Related Questions

Navigate

• Browse (All)
• Browse N
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.