태코놀로지

Simple means to resolve collision- "Chaining": Use linked-lists. New key inserted at the head of a list.(충돌난 hash slot에 linked-list를 이용해서 주렁주렁 이어 달자. 단 head!) Why not inserted at the tail?(왜 tail이 아니라, head?) tail에 달기 위해서, tail까지 탐색이 필요한데,search operation of linked-list takes linear time(i.e., proportional to the size)

Advantages1. Size varies dynamically (dynamic set)- Unlike the static array (static set) you don't need to reserve a large memory in advance2. Insertion, deletion, merging, splitting take only constant time (cf. takes linear time for search operation)- In contrast, array takes linear time (i.e., proportional to the size) for these operations Disadvantages1. You cannot access an element using an ..