We are doing major maintenance work during the last week of October. Expect the wiki be unavailable for some time.

Algorithm Design

From Decoding the Disciplines
Revision as of 15:15, 7 March 2026 by Riegler (talk | contribs) (-typo)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Description of bottleneck[edit | edit source]

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.

References[edit | edit source]

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