Algorithm Design: Difference between revisions
Jump to navigation
Jump to search
init |
Changed categories. |
||
| Line 12: | Line 12: | ||
[[Evaluating the Decoding the Disciplines Paradigm From a Student Perspective in Teaching Algorithm Design]] | [[Evaluating the Decoding the Disciplines Paradigm From a Student Perspective in Teaching Algorithm Design]] | ||
[[Category:Bottleneck]] | [[Category:Bottleneck]] | ||
[[Category:Computer Science]] | |||
Revision as of 09:29, 20 November 2025
Description of bottleneck
In their work on algorithm design Yaqoob et al. list and investigate the following bottlenecks related to sorting algorithms:
- Understanding the nested structureand the design approach
- The usefulness of the divide step.
- Understanding recursions tocombining solution to sub-problems.
- Dealing with repeated numbers using indices.
- How to transform the algorithm to handle largeand negative numbers.
- Understanding the stable version.