Converting pseudocode into Python functions (greedy techniques)
In current studies of data structure algorithms, most of the classes are taught in terms of pseudocode with no real-world context. With such a structure, students would need more insight into understanding why data structure analysis (DSA) is important. With the lack of real-world context, students...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project |
| Language: | English |
| Published: |
Nanyang Technological University
2024
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/176997 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | In current studies of data structure algorithms, most of the classes are taught in terms of pseudocode with no real-world context. With such a structure, students would need more insight into understanding why data structure analysis (DSA) is important. With the lack of real-world context, students may not be able to utilize what they have picked in the course.
With this, a study of greedy algorithms with Python was proposed. The study aimed to ensure that the codes are clearly explained. The project should include analysis and comparison between different greedy algorithms, and step to step guides to implement the code, and most importantly real-world application of using the greedy algorithm. With these components, students should be able to take away a valuable understanding of greedy algorithms in Python language. |
|---|