The definition and validation of the radix sorting technique

Authors:
John A. N. Lee
Affiliations:
University of Mass., Dept. of Computer Science
Venue:
Proceedings of ACM conference on Proving assertions about programs
Year:
1972

Citing 1
Cited 1

Von Neumann's First Computer Program

ACM Computing Surveys (CSUR)

New directions in teaching the fundamentals of computer science — discrete structures and computational analysis

SIGCSE '73 Proceedings of the third SIGCSE technical symposium on Computer science education

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on the formal definition techniques of Lucas et al[1] which have been applied to the description of programming languages, this paper defines the algorithm of radix sorting and develops a proof of its validity.