Algorithms and Data Structure course
- Complexity
- Memory
- Stack
- Queue
- Deque
- Linked lists.
- Doubly-Linked lists.
- Linear
- Binary
- Binary search tree.
- Priority queues.
- Heap sort
- Merge sort
- Quick Sort.
- Rabin-Karp algorithm based on hash calculation.
- Knuth-Morris-Pratt algorithm
- Representation of graphs in computer: adjacency
- BFS.
- DFS.
- Topological Sort.
- Spanning tree algorithms (Kruskal, Prima)
- Dijkstra
- Ford Bellman
- Floyd