|
7 | 7 |
|
8 | 8 |
|
9 | 9 | # Subjects:
|
10 |
| - 1. Lab1: Iterators and saving to file `8/10` |
11 |
| - 2. Lab2: Filter iterators `15/20` |
12 |
| - 3. Lab3: Queues and Stacks `16/20` |
13 |
| - 4. Lab4: Linked Lists `18/20` |
14 |
| - 5. Lab5: Insertion Sort, Selection Sort, Bubble Sort `18/20` |
15 |
| - 6. Lab6: Insertion Sort, Selection Sort, Bubble Sort - Performance `16/20` |
16 |
| - 7. Lab7: Merge Sort, Quick Sort, Heap Sort `16/20` |
17 |
| - 8. Lab8: Heap Data Structure `12/20` |
18 |
| - 9. Lab9: Hashing Data Structure `14/20` |
19 |
| - 10. Lab10: Binary Search Tree `13/20` |
20 |
| - 11. Lab11: Red-Black Tree, 2-3-4 Tree `12/20` |
21 |
| - 12. Lab12: Disjoint sets, comparison of trees `12/20` |
22 |
| - 13. Lab13: Graphs `12/20` |
23 |
| - 14. Lab14: Algorithms: Prim, Kruskal, Dijkstra `12/20` |
24 |
| - 15. Lab15: Huffman Coding `without mark` |
| 10 | + 1. Lab1: Iterators and saving to file |
| 11 | + 2. Lab2: Filter iterators |
| 12 | + 3. Lab3: Queues and Stacks |
| 13 | + 4. Lab4: Linked Lists |
| 14 | + 5. Lab5: Insertion Sort, Selection Sort, Bubble Sort |
| 15 | + 6. Lab6: Insertion Sort, Selection Sort, Bubble Sort - Performance |
| 16 | + 7. Lab7: Merge Sort, Quick Sort, Heap Sort |
| 17 | + 8. Lab8: Heap Data Structure |
| 18 | + 9. Lab9: Hashing Data Structure |
| 19 | + 10. Lab10: Binary Search Tree |
| 20 | + 11. Lab11: Red-Black Tree, 2-3-4 Tree |
| 21 | + 12. Lab12: Disjoint sets, comparison of trees |
| 22 | + 13. Lab13: Graphs |
| 23 | + 14. Lab14: Algorithms: Prim, Kruskal, Dijkstra |
| 24 | + 15. Lab15: Huffman Coding |
0 commit comments