class HashTable: def _ _ init _ _ ( self , m = 1 0 ) :
Fantastic news! We've Found the answer you've been seeking!
Question:
class HashTable:
def initself m:
# default initial array length: threshold:
self.inArray LinkedList for i in rangem
self.size
self.threshold
def addself d:
i self.hashd
self.inArrayiinsertd
self.size
if self.size self.thresholdlenselfinArray:
self.resizeUp
def resizeUpself:
oldArray self.inArray
self.inArray LinkedList for i in rangelenoldArray
for i in rangelenoldArray:
while oldArrayilength :
d oldArrayiremove
self.inArrayselfhashdinsertd
Write a function:
def resizeUpself
that, similarly to the corresponding function for HashTable that we saw in class, doubles the length of the internal linked list and rehashes and reinserts all of the elements.
Related Book For
Income Tax Fundamentals 2013
ISBN: 9781285586618
31st Edition
Authors: Gerald E. Whittenburg, Martha Altus Buller, Steven L Gill
Posted Date: