Inventing a new sorting algorithm: a case study

@inproceedings{Merritt1990InventingAN,
  title={Inventing a new sorting algorithm: a case study},
  author={Susan M. Merritt and Cecilia Y. Nauck},
  booktitle={SIGCSE},
  year={1990}
}
Dijkstra’s algorithm for finding the length of the longest upsequence within a given sequence of numbers is used as the basis for a case study in the development of a new sorting algorithm. The case study has pedagogic value for several reasons: the motivation for each step in the development of the algorithm is explained; interesting data structures are introduced; the complexity of the algorithm is analyzed using mathematics familiar to first year computer science students; the appendices… CONTINUE READING

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…