Software complexity: A statistical case study through insertion sort

摘要

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.