Last edited 2 weeks ago
by Peter Riegler

Algorithm Design

Revision as of 10:29, 20 November 2025 by Peter Riegler (talk | contribs) (Changed categories.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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.

References

Evaluating the Decoding the Disciplines Paradigm From a Student Perspective in Teaching Algorithm Design