Abstract
We discuss a mechanized correctness proof in KeY of Counting sort and Radix sort. Counting sort is an unusual sorting algorithm in the sense that it is based on arithmetic rather than comparisons. Radix sort is tailored to sorting arrays of large numbers. It uses an auxiliary sorting algorithm, such as Counting sort, to sort the digits of the large numbers one-by-one. The correctness of Radix sort requires the stability of the auxiliary sorting algorithm. Stability here means that the order between different occurrences of the same number is preserved. The correctness proof of Counting sort includes a proof of its stability.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this chapter
Cite this chapter
de Gouw, S., de Boer, F.S., Rot, J. (2016). Verification of Counting Sort and Radix Sort. In: Ahrendt, W., Beckert, B., Bubel, R., Hähnle, R., Schmitt, P., Ulbrich, M. (eds) Deductive Software Verification – The KeY Book. Lecture Notes in Computer Science(), vol 10001. Springer, Cham. https://doi.org/10.1007/978-3-319-49812-6_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-49812-6_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-49811-9
Online ISBN: 978-3-319-49812-6
eBook Packages: Computer ScienceComputer Science (R0)