Suppose we are given a hash table of size 100, and a hash function h(x) = x mod 100. If we use linear probing to resolve collisions, and we are given 50 elements, what is the average number of probes needed to find each element when the elements are stored in the following order:


100, 200, ..., 1000, 101, 201, ..., 1001, 102, 202, ..., 1002, 103, 203, ..., 1003, 104, 204, ..., 1004


이런 간단한 자료구조 문제인데, 비추론 모델 중에 이 문제 푼 건 그록3가 처음임ㅋㅋ