Verification of Counting Sort and Radix Sort

Part of the Lecture Notes in Computer Science book series (LNCS, volume 10001)


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.


Auxiliary Function Sorting Algorithm Proof Obligation Correctness Proof Rule Application 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.Open UniversityHeerlenThe Netherlands
  2. 2.Centrum voor Wiskunde en InformaticaAmsterdamThe Netherlands
  3. 3.Radboud UniversityNijmegenThe Netherlands

Personalised recommendations