On Clarifying the Asymptotic Behavior of the Complexity Function of the Bubble Sort Algorithm

The study presents asymptotic analysis of a discrete sum of a special form based on application of the Mellin transform technique followed by the complex integration method. The approach is demonstrated on the example of calculating the second and third terms of the asymptotic expansion of the cost function of the bubble sort algorithm. However, the proposed technique is also applicable to other sums of a similar type.