数据结构第三次作业第二题（HASH）_制造下列候选项集合的hash树-优快云博客

这段代码实现了一个简单的哈希表插入函数，并计算了加载因子。它读取一串由逗号分隔的整数，将它们插入哈希表，并输出加载因子和平均查找次数的比率。

在这里插入图片描述

#include <stdio.h>
#include <stdlib.h>
//hash
//2
int maxsize = 13;
int min = -99999;

typedef struct hash
{
    int *data;
    int count;
} HashTable;

int Hash(int key)
{
    return key % maxsize;
}

int times = 0;
int loading_times = 0;

void InsertHash(HashTable *H, int key)
{
    int addr = Hash(key);
    times++;
    while (H->data[addr] != min)
    {
        times++;
        addr = (addr + 1) % maxsize;
    }
    H->data[addr] = key;
    loading_times++;
}

int main()
{
    char a[100];
    gets(a);
    int i = 0;
    int sum = 0;
    HashTable H;
    H.count = 13;
    H.data = (int *)malloc(sizeof(int) * maxsize);
    for (i = 0; i < 13; i++)
        H.data[i] = min;
    i = 0;
    while (a[i])
    {
        if (a[i] != ',')
        {
            sum = sum * 10 + a[i] - '0';
        }
        else if (a[i] == ',')
        {
            // printf("%d\n", sum);
            InsertHash(&H, sum);
            // printf("1=%d 2=%d 3=%d 4=%d\n", H.data[12], H.data[0], H.data[1], H.data[2]);
            sum = 0;
        }
        i++;
    }
    // printf("1=%d 2=%d 3=%d 4=%d\n", H.data[12], H.data[0], H.data[1], H.data[2]);
    double print=(double)loading_times/13;
    printf("%.2lf\n",print);
    printf("%.2lf", (double)times/loading_times);
    return 0;
}