Hashtable algorithm written in python

hashtable.py

#create the key-value object
class KeyValue:
	def __init__(self,key,value):
		self.key=key
		self.value=value


class HashTable:
	#initiate an empty list that will store all key value pair based on the KeyValue object
	def __init__(self):
    	self.list=[]
	
	#get matching item based on key in the hashtable
	def get(self,key):
    #loop through all items in the list and find the KeyValue pair with the correct key
		for item in self.list:
			if item.key == key:
				return item.value
				break
		return "not found"
	
  #add a new KeyValue object into the hashtable
	def set(self,key,value):
		keyValue = KeyValue(key,value)
		self.list.append(keyValue)

#testrun
hashTable = HashTable()
hashTable.set('paijo',123)
hashTable.set('kangmas',234)
print hashTable.get('paijo')
print hashTable.get('samidjan')