Algoritms and data structures

Description

Solutions for Algorithms and Data Structures course on AGH in Automatic control and robotics field

Matrix class
Chio`s method
Linked list
Doubly linked list
Cirrcular array
Unrolled linked list (TO FIX: interation must not include None)
Hash table (TO FIX: search and remove computational complexity from O(n) to O(1))
Binary tree BST
Heap priority queue
Heap sort
Selection sort
Btree - not finished

Name		Name	Last commit message	Last commit date
Latest commit History 65 Commits
graphs_adjacency		graphs_adjacency
search_for_pattern		search_for_pattern
.gitignore		.gitignore
Ford_Fulkerson_Algorithm.py		Ford_Fulkerson_Algorithm.py
README.md		README.md
aprox_str_matching.py		aprox_str_matching.py
binary_treeBST.py		binary_treeBST.py
btree.py		btree.py
calc_det_chio.py		calc_det_chio.py
convex_hull.py		convex_hull.py
doubly_linked_list.py		doubly_linked_list.py
hash_table.py		hash_table.py
heap_priority_queue.py		heap_priority_queue.py
heapsort.py		heapsort.py
linked list.py		linked list.py
matrixclass.py		matrixclass.py
prim_algorithm.py		prim_algorithm.py
queue_on_cyclic_table.py		queue_on_cyclic_table.py
sample.png		sample.png
selection_sort.py		selection_sort.py
skip_list.py		skip_list.py
ullman.py		ullman.py
unrolled_linked_list.py		unrolled_linked_list.py