Linear complexity assertions for sorting
Published in IEEE Transactions on Software Engineering • Jun 1, 1994
Authors:,
N.R. Saxena
E.J. McCluskey
Abstract
Correctness of the execution of sorting programs can be checked by two assertions: the order assertion and the permutation assertion. The order assertion checks if the sorted data is in ascending or descending order. The permutation assertion checks if the output data produced by sorting is a permut...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!