https://github.com/marianciuc/algorithms
The repository includes a series of laboratory works, each focusing on different aspects of algorithms
https://github.com/marianciuc/algorithms
algorithms-and-data-structures cpp
Last synced: about 2 months ago
JSON representation
The repository includes a series of laboratory works, each focusing on different aspects of algorithms
- Host: GitHub
- URL: https://github.com/marianciuc/algorithms
- Owner: marianciuc
- Created: 2023-10-22T23:39:13.000Z (about 2 years ago)
- Default Branch: main
- Last Pushed: 2024-07-31T13:08:39.000Z (over 1 year ago)
- Last Synced: 2025-07-26T23:53:13.924Z (4 months ago)
- Topics: algorithms-and-data-structures, cpp
- Language: C++
- Homepage: http://wikizmsi.zut.edu.pl/wiki/A2/L?imoppppppphlfcba
- Size: 8.34 MB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Algorithms 2
The repository includes a series of laboratory works, each focusing on different aspects of algorithms. Below is a list of the topics covered:
1. **List**: Understanding and implementing list data structures.
2. **Dynamic Array**: Exploration of dynamic arrays and their applications.
3. **BST Tree**: Binary Search Tree implementation and operations.
4. **Red-Black Tree**: Learning about Red-Black Trees and their properties.
5. **Hash Table**: Implementing and using hash tables.
6. **Binary Heap**: Study and implementation of binary heaps.
7. **Sorting Algorithms**: Focus on Heapsort, Counting Sort, and Bucket Sort.
8. **Graph Algorithms**: Kruskal's algorithm and Union-Find structure.
9. **Convex Hull**: Understanding Convex Shell and Graham's algorithm.
10. **Fast Fourier Transform**: An introduction to FFT and its applications.
Each laboratory work is accompanied by detailed instructions and resources to facilitate learning and implementation.
## Resources
For more detailed information and resources related to the laboratory works, visit [this link](http://wikizmsi.zut.edu.pl/wiki/A2/L?imoppppppphlfcba).
№
Description
Download link
1
List
(PDF)
2
Dynamic array
(PDF)
3
BST tree
(PDF)
4
Red-black tree
(PDF)
5
Hash table
(PDF)
6
Binary heap
(PDF)
7
Heapsort, counting sort, bucket sort
(PDF)
8
Kruskal algorithm and Union-Find structure
(PDF)
(ZIP)
9
Convex shell, Graham's algorithm
(PDF)
(ZIP)
10
Fast Fourier transform
(PDF)