Niraj Kumar Singh, Soubhik Chakraborty and Dheeresh Kumar Mallick, BIT Mesra, India

Theoretical analysis of algorithms involves counting of operations and a separate bound is provided for a specific operation type. Such a methodology is plagued with its inherent limitations. In this paper we argue as to why we should prefer weight based statistical bounds, which permit mixing of operations, instead as a robust approach. Empirical analysis is an important idea and should be used to supplement and compliment its existing theoretical counterpart as empirically we can work on weights (e.g. time of an operation can be taken as its weight). Not surprisingly, it should not only be taken as an opportunity so as to amend the mistakes already committed knowingly or unknowingly but also to tell a new story.

Theoretical analysis, empirical analysis, statistical bounds, empirical-O, average case analysis, computer experiment section.