Skip to content
Open
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
6 changes: 5 additions & 1 deletion 01_pole.py
Original file line number Diff line number Diff line change
Expand Up @@ -9,11 +9,15 @@ def measure_time(operation, *args):

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 elements)
return results

if __name__ == "__main__":
array = []
Expand Down
15 changes: 12 additions & 3 deletions 02_hashmap_chaining.py
Original file line number Diff line number Diff line change
Expand Up @@ -8,15 +8,24 @@ def __init__(self, size):

def hash_function(self, key):
# TODO: Implementovat hashovací funkci
pass
return hash(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 i, (existing_key, value) in enumerate(self.table[index]):
if existing_key == key:
self.table[index][i] = (key, 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 existing_key, value in self.table[index]:
if existing_key == key:
return value

def measure_time(operation, *args):
start = time.time()
Expand Down
20 changes: 16 additions & 4 deletions 03_hashmap_open_addressing.py
Original file line number Diff line number Diff line change
Expand Up @@ -8,15 +8,27 @@ def __init__(self, size):

def hash_function(self, key):
# TODO: Implementovat hashovací funkci
pass

return hash(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)

while self.table[index] is not None:
existing_key, value = self.table[index]
if existing_key == key:
self.table[index] = (key, value)
return
index = (index + 1) % self.size
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)
while self.table[index] is not None:
if self.table[index][0] == key:
return self.table[index][1]
index = (index +1) % self.size

def measure_time(operation, *args):
start = time.time()
Expand Down
10 changes: 7 additions & 3 deletions 04_built_in_hashmap.py
Original file line number Diff line number Diff line change
Expand Up @@ -9,12 +9,16 @@ def measure_time(operation, *args):

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 = {}
data = list(range(1, 100001))
Expand Down