Hash Table Tasarımı: Çarpışma Çözme Yöntemleri ve Kod Örnekleri

1#include <stdio.h>
2#include <stdlib.h>
3#include <string.h>
4
5#define TABLE_SIZE 10
6
7typedef struct Node {
8char *key;
9int value;
10struct Node *next;
11} Node;
12
13typedef struct {
14Node *table[TABLE_SIZE];
15} HashTable;
16
17int hash(char *key) {
18int sum = 0;
19for (int i = 0; key[i]!= '\0'; i++) {
20sum += key[i];
21}
22return sum % TABLE_SIZE;
23}
24
25HashTable* createHashTable() {
26HashTable *ht = (HashTable*)malloc(sizeof(HashTable));
27for (int i = 0; i < TABLE_SIZE; i++) {
28ht->table[i] = NULL;
29}
30return ht;
31}
32
33void insert(HashTable *ht, char *key, int value) {
34int index = hash(key);
35Node *newNode = (Node*)malloc(sizeof(Node));
36newNode->key = (char*)malloc(strlen(key) + 1);
37strcpy(newNode->key, key);
38newNode->value = value;
39newNode->next = ht->table[index];
40ht->table[index] = newNode;
41}
42
43int search(HashTable *ht, char *key) {
44int index = hash(key);
45Node *current = ht->table[index];
46while (current!= NULL) {
47if (strcmp(current->key, key) == 0) {
48return current->value;
49}
50current = current->next;
51}
52return -1;
53}
54
55int main() {
56HashTable *ht = createHashTable();
57
58insert(ht, "ali", 100);
59insert(ht, "veli", 200);
60insert(ht, "ayse", 300);
61
62printf("ali: %d\n", search(ht, "ali"));
63printf("veli: %d\n", search(ht, "veli"));
64printf("ayse: %d\n", search(ht, "ayse"));
65printf("osman: %d\n", search(ht, "osman"));
66
67return 0;
68}

1ali: 100
2veli: 200
3ayse: 300
4osman: -1