Software Complexity: A Statistical Case Study Through Insertion Sort

by Anchala Kumari and Soubhik Chakraborty .

Abstract: The present paper makes use of factorial experiments to assess software complexity using insertion sort as a trivial example. We next propose to implement the methodology in quicksort and other advanced algorithms later on.

Key Words: Insertion sort, average complexity, interchanges, parameters of input distribution, stochastic modeling of deterministic computer experiment

Authors:
Anchala Kumari, anchalak@yahoo.com
Soubhik Chakraborty, soubhikc@yahoo.co.in

Editor: R. G. Graf, rgraf@sunstroke.sdsu.edu

READING THE ARTICLE: You can read the article in portable document (.pdf) format (120761 bytes.)

NOTE: The content of this article is the intellectual property of the authors, who retains all rights to future publication.

This page has been accessed 352 times since October 10, 2006.

Return to the InterStat Home Page.