#include<stdio.h>
#include<string.h>
#include<stdlib.h>

//m = table size
int m = 23;

struct tnode{
    char value[10];
    int step;
}*ND[25];

int hashing(char value[10]){
    //complete the code to do hashing using division hashing function
    //add all the character ASCII in the string
    int key;
    int sum = 0;
    for(int i=0; i<5; i++){
        sum += value[i];
    }
    key = sum % m;

    return key;
}

struct tnode *newData(char value[10]){
    //complete the code to create a new tnode name ND
    struct tnode *ND = (struct tnode*)malloc(sizeof(struct tnode));
    strcpy(ND->value, value);
    ND->step = 0;
    return ND;
}

void insert(char value[10]){
    struct tnode *N_Data = newData(value);
    int key = hashing(value);
    //complete the code to insert new data to hash table. If there is any collision, use linear probing to solve it and show ‘TABLE IS FULL!!!’ when the hash table is full or the data cannot be insert to the table.

    if(ND[key]==NULL){
        ND[key] = N_Data;
    }
    else{
        int curr = key;
        while(ND[curr]!=NULL && curr<m){
            curr++;
            N_Data->step = N_Data->step + 1;
        }

        if(curr>=m){
            printf("TABLE IS FULL!!!\n");
        }
        else{
            ND[curr] = N_Data;
        }
    }
}

void view(){
    for(int i=0;i<m;i++){
        if(ND[i]) printf("[%d]\t%s (%d step(s))\n", i, ND[i]->value, ND[i]->step+1);
        else printf("[%d]\tNULL\n", i);
    }
}

int main(){
    for(int i=0;i<m;i++){
        ND[i] = NULL;
    }

    insert("AAAAA");
    insert("BBBBB");
    insert("CCCCC");
    insert("AAABB");
    insert("BABAA");
    insert("BAABA");
    insert("BBAAA");
    insert("ABBAA");


    view();
    return 0;
}