Question

Using C code

1. Consider a hash table that is implemented using the following struct definitions.

#define NUMBUCKETS 10

typedef struct _HTE {
    int Key;
    int Value;
    struct _HTE *Next;
} HashTableEntry;

typedef struct _HT {
    HashTableEntry *Buckets[ NUMBUCKETS ];
    unsigned int Size;
} HashTable;

a.) Complete the following function, which takes a pointer to a HashTableEntry, which is the head of a linked list of entries, and an integer x. It returns the first entry in the list whose value is greater than x or NULL if the list doesn’t have such an entry. Be sure to declare and initialize any local variables. Using the following implementation:

HashTableEntry* Get_First_Larger(HashTableEntry* head, int x) {

....

}

Answer 1

#include<stdio.h>

#define NUMBUCKETS 10

typedef struct _HTE {
    int Key;
    int Value;
    struct _HTE *Next;
} HashTableEntry;

typedef struct _HT {
    HashTableEntry *Buckets[ NUMBUCKETS ];
    unsigned int Size;
} HashTable;

HashTableEntry* Get_First_Larger(HashTableEntry* head, int x) {
   while(head != NULL){
       if(head->Value > x) return head;
       head = head->Next;
   }
   return NULL;
}