Confidence complexity of computer algorithms

Abstract

A statistical research of an algorithm complexity as a random value was carried out via numerical experimentation using parallel computation. For a segment of input data sizes point characteristics for this random value and its confidence interval are obtained. Confidence complexity function value based on gamma-distribution is determined. The following result have been obtained: the used criteria are adequate for predicting the mean execution time and its confidence intervals for given input types.