Article ID Journal Published Year Pages File Type
4635257 Applied Mathematics and Computation 2007 11 Pages PDF
Abstract
The present paper makes use of factorial experiments to assess software complexity using insertion sort as an example. A new modeling for insertion sort is proposed. It might be of interest to implement the methodology in quicksort and other advanced algorithms.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Applied Mathematics
Preview
Software complexity: A statistical case study through insertion sort
Authors
, ,