Skip to content
Open

SP #12

Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 5 additions & 3 deletions 01_pole.py
Original file line number Diff line number Diff line change
Expand Up @@ -8,12 +8,14 @@ def measure_time(operation, *args):
return result, end - start

def add_elements(array, elements):
# TODO: Přidat všechny prvky z "elements" do pole "array"
array.extend(elements)
pass

def find_elements(array, elements):
# TODO: Najít všechny prvky z "elements" v poli "array"
pass
results = []
for el in elements:
results.append(el in array)
return results

if __name__ == "__main__":
array = []
Expand Down
17 changes: 11 additions & 6 deletions 02_hashmap_chaining.py
Original file line number Diff line number Diff line change
Expand Up @@ -7,16 +7,21 @@ def __init__(self, size):
self.table = [[] for _ in range(size)]

def hash_function(self, key):
# TODO: Implementovat hashovací funkci
pass
return key % self.size

def add(self, key, value):
# TODO: Přidat prvek s klíčem "key" a hodnotou "value" do hashmapy
pass
index = self.hash_function(key)
for pair in self.table[index]:
if pair[0] == key:
pair[1] = value
return

def find(self, key):
# TODO: Najít prvek s klíčem "key" v hashmapě a vrátit jeho hodnotu
pass
index = self.hash_function(key)
for pair in self.table[index]:
if pair[0] == key:
return pair[1]
return None

def measure_time(operation, *args):
start = time.time()
Expand Down
24 changes: 18 additions & 6 deletions 03_hashmap_open_addressing.py
Original file line number Diff line number Diff line change
Expand Up @@ -7,16 +7,28 @@ def __init__(self, size):
self.table = [None] * size

def hash_function(self, key):
# TODO: Implementovat hashovací funkci
pass
return key % self.size

def add(self, key, value):
# TODO: Přidat prvek s klíčem "key" a hodnotou "value" do hashmapy
pass
index = self.hash_function(key)
original_index = index
while self.table[index] is not None:
index = (index + 1) % self.size
if index == original_index:
raise Exception("Hash table is full")
self.table[index] = (key, value)

def find(self, key):
# TODO: Najít prvek s klíčem "key" v hashmapě a vrátit jeho hodnotu
pass
index = self.hash_function(key)
original_index = index
while self.table[index] is not None:
stored_key, stored_value = self.table[index]
if stored_key == key:
return stored_value
index = (index + 1) % self.size
if index == original_index:
break
return None

def measure_time(operation, *args):
start = time.time()
Expand Down
10 changes: 6 additions & 4 deletions 04_built_in_hashmap.py
Original file line number Diff line number Diff line change
Expand Up @@ -8,12 +8,14 @@ def measure_time(operation, *args):
return result, end - start

def add_elements(hash_map, keys, values):
# TODO: Přidat všechny klíče a hodnoty do hashmapy
pass
for key, value in zip(keys, values):
hash_map[key] = value

def find_elements(hash_map, keys):
# TODO: Najít všechny klíče v hashmapě
pass
results = []
for key in keys:
results.append(hash_map.get(key))
return results

if __name__ == "__main__":
hash_map = {}
Expand Down