(init) |
(-typo) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 4: | Line 4: | ||
* Understanding the nested structureand the design approach | * Understanding the nested structureand the design approach | ||
* The usefulness of the divide step. | * The usefulness of the divide step. | ||
* Understanding recursions | * Understanding recursions to combining solution to sub-problems. | ||
* Dealing with repeated numbers using indices. | * Dealing with repeated numbers using indices. | ||
* How to transform the algorithm to handle largeand negative numbers. | * How to transform the algorithm to handle largeand negative numbers. | ||
| 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]] | |||
Latest revision as of 16:15, 7 March 2026
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 to combining solution to sub-problems.
- Dealing with repeated numbers using indices.
- How to transform the algorithm to handle largeand negative numbers.
- Understanding the stable version.
