Abstract
Topological sorting provides a partial ordering for a group of data items for which a partial linear ordering exists.
Our use of the topological sorting algorithm has been in the logical organization of curriculum content. Curriculum content can vary from organizing a forty minute lecture to planning a four year sequence of courses. Application of topological sorting to the curriculum content results in a logical organization of the concepts, which may or may not be unique. Users of TOPSORT claim a major time savings in the long run. Backtracking to cover prerequisite concepts in teaching is reduced.
- 1 D. Knuth, The Art of Computer Programming, Vol. 1. Addison-Wesley, Reading, Massachusetts, 1968, 258-265. Google Scholar
Digital Library
- 2 J. Healy, D. DeBruzzi (Authors), C. Bauer and A. Peluso (Editors), Basic FORTRAN IV Programming, Revised Edition, Addison-Wesley, Reading, Massachusetts, 1975. Google Scholar
Digital Library
- 3 D. Knuth, op. cit., 265.Google Scholar
Index Terms
Topological sorting as a tool in curriculum planning
Recommendations
Topological sorting as a tool in curriculum planning
SIGCSE '76: Proceedings of the sixth SIGCSE technical symposium on Computer science educationTopological sorting provides a partial ordering for a group of data items for which a partial linear ordering exists.
Our use of the topological sorting algorithm has been in the logical organization of curriculum content. Curriculum content can vary ...
Cache Efficient Radix Sort for String Sorting
In this paper, we propose CRadix sort, a new string sorting algorithm based on MSD radix sort. CRadix sort causes fewer cache misses than MSD radix sort by uniquely associating a small block of main memory called the key buffer to each key and ...






Comments