Converting pseudocodes into Python functions (sorting algorithms)
Sorting algorithms are fundamental tools used to organize elements within a list, playing a crucial role in various applications such as e-commerce, data sorting, and network routing. This research project delves into a comprehensive analysis and comparison of various sorting algorithms, extending b...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project (FYP) |
| Language: | English |
| Published: |
Nanyang Technological University
2024
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/176901 |
| _version_ | 1826123436687097856 |
|---|---|
| author | Sylvia Deborah |
| author2 | S Supraja |
| author_facet | S Supraja Sylvia Deborah |
| author_sort | Sylvia Deborah |
| collection | NTU |
| description | Sorting algorithms are fundamental tools used to organize elements within a list, playing a crucial role in various applications such as e-commerce, data sorting, and network routing. This research project delves into a comprehensive analysis and comparison of various sorting algorithms, extending beyond the curriculum of a typical university course. The objective is to explore the practicality of different sorting algorithms for specific scenarios and inspire further research around this area.
This project consists of two main stages: first, understanding the mechanics of various sorting algorithms, and second, analyzing their functionalities by comparing their time complexities based on data provided. The focus is primarily on general sorting and how each is useful in its own way based on the requirements.
The goal of this project is to show the reasons different sorting algorithms exist, investigate their usage in practical situations, and study their efficiency. Moreover, this project aims to provide visual representations of sorting algorithms in order to aid replication and customisation for further research. By means of this thorough investigation, this project aspires to pique interest and stimulate further study into less-studied sorting algorithms, resulting in a more profound comprehension of their usefulness in various scenarios. |
| first_indexed | 2024-10-01T06:04:38Z |
| format | Final Year Project (FYP) |
| id | ntu-10356/176901 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T06:04:38Z |
| publishDate | 2024 |
| publisher | Nanyang Technological University |
| record_format | dspace |
| spelling | ntu-10356/1769012024-05-24T15:43:53Z Converting pseudocodes into Python functions (sorting algorithms) Sylvia Deborah S Supraja School of Electrical and Electronic Engineering supraja.s@ntu.edu.sg Engineering Sorting algorithms are fundamental tools used to organize elements within a list, playing a crucial role in various applications such as e-commerce, data sorting, and network routing. This research project delves into a comprehensive analysis and comparison of various sorting algorithms, extending beyond the curriculum of a typical university course. The objective is to explore the practicality of different sorting algorithms for specific scenarios and inspire further research around this area. This project consists of two main stages: first, understanding the mechanics of various sorting algorithms, and second, analyzing their functionalities by comparing their time complexities based on data provided. The focus is primarily on general sorting and how each is useful in its own way based on the requirements. The goal of this project is to show the reasons different sorting algorithms exist, investigate their usage in practical situations, and study their efficiency. Moreover, this project aims to provide visual representations of sorting algorithms in order to aid replication and customisation for further research. By means of this thorough investigation, this project aspires to pique interest and stimulate further study into less-studied sorting algorithms, resulting in a more profound comprehension of their usefulness in various scenarios. Bachelor's degree 2024-05-23T04:47:59Z 2024-05-23T04:47:59Z 2024 Final Year Project (FYP) Sylvia Deborah (2024). Converting pseudocodes into Python functions (sorting algorithms). Final Year Project (FYP), Nanyang Technological University, Singapore. https://hdl.handle.net/10356/176901 https://hdl.handle.net/10356/176901 en A3269-231 application/pdf Nanyang Technological University |
| spellingShingle | Engineering Sylvia Deborah Converting pseudocodes into Python functions (sorting algorithms) |
| title | Converting pseudocodes into Python functions (sorting algorithms) |
| title_full | Converting pseudocodes into Python functions (sorting algorithms) |
| title_fullStr | Converting pseudocodes into Python functions (sorting algorithms) |
| title_full_unstemmed | Converting pseudocodes into Python functions (sorting algorithms) |
| title_short | Converting pseudocodes into Python functions (sorting algorithms) |
| title_sort | converting pseudocodes into python functions sorting algorithms |
| topic | Engineering |
| url | https://hdl.handle.net/10356/176901 |
| work_keys_str_mv | AT sylviadeborah convertingpseudocodesintopythonfunctionssortingalgorithms |