将对地址表中每个地址的值进行排序。因此，我们逐个迭代每个地址，并在输入数组中的该地址处插入值。

# Python3 code for implementation of 

# Address Calculation Sorting using Hashing

# Size of the address table (In this case 0-9)

SIZE = 10

class Node(object):

def __init__(self, data = None):

self.data = data

self.nextNode = None

class LinkedList(object):

def __init__(self):

self.head = None

# Insert values in such a way that the list remains sorted

def insert(self, data):

newNode = Node(data)

# If there is no node or new Node's value

# is smaller than the first value in the list,

# Insert new Node in the first place

if self.head == None or data < self.head.data:

newNode.nextNode = self.head

self.head = newNode

else:

current = self.head

# If the next node is null or its value

# is greater than the new Node's value,

# Insert new Node in that place

while current.nextNode != None \

and \

current.nextNode.data < data:

current = current.nextNode

newNode.nextNode = current.nextNode

current.nextNode = newNode

# This function sorts the given list 

# using Address Calculation Sorting using Hashing

def addressCalculationSort(arr):

# Declare a list of Linked Lists of given SIZE

listOfLinkedLists = []

for i in range(SIZE):

listOfLinkedLists.append(LinkedList())

# Calculate maximum value in the array

maximum = max(arr)

# Find the address of each value

# in the address table 

# and insert it in that list

for val in arr:

address = hashFunction(val, maximum)

listOfLinkedLists[address].insert(val)

# Print the address table 

# after all the values have been inserted

for i in range(SIZE):

current = listOfLinkedLists[i].head

print("ADDRESS " + str(i), end = ": ")

while current != None:

print(current.data, end = " ")

current = current.nextNode

print()

# Assign the sorted values to the input array

index = 0

for i in range(SIZE):

current = listOfLinkedLists[i].head

while current != None:

arr[index] = current.data

index += 1

current = current.nextNode