「アルゴリズムを、はじめよう」ハッシュ探索法をPythonで書く（データ取り出し編）

#!/usr/bin/env python
#-*- coding: utf-8 -*-

class Hash:
    def __init__(self):
        self.arrayD = [12, 25, 36, 20, 30, 8, 42]
        self.arrayH = [0] * 11
        self.max = len(self.arrayH)
    def insert(self):
        for d in self.arrayD:
            k = d % 11
            count = 0
            while count < self.max:
                if self.arrayH[k] == 0:
                    self.arrayH[k] = d
                    break
                else:
                    k += 1
                    if k >= self.max - 1:
                        k = 0
                        count += 1
        print self.arrayH
    def search(self, num):
        ans = num % 11
        count = 0
        while count < self.max:
            if self.arrayH[ans] == num:
                print "%d is in the arrayH[%d]." % (num, ans)
                break
            else:
                ans += 1
                if ans >= self.max - 1:
                    ans = 0
                count += 1

if __name__ == '__main__':
    hash = Hash()
    hash.insert()
    hash.search(12)