Performance Evaluation of Some Selected Sorting Algorithms by the Use of Halstead Complexity Metrics
Complexity is developed to demonstrate feasible metrics for process obtaining objectives and quantifiable measurement, which may have numerous valuable applications in schedule and budget planning, cost estimation and optimal personnel task assignments a particular software. Also it aids the developer and practitioners in evaluating the software complexity due to its simplicity, which serves both as an analyzer and as a predicator in quantitative software engineering. In this research work, the Halstead complexity metrics were applied to three sorting algorithms and C-Sharp programming language was used to implement them. The results shows the variant performances of sorting algorithms and the best algorithm that can perform better in a defined system of application.
(1) McCall, M.M (1977) :Art Without A.market: Creating value in a Provincial Artword Sym:Software System Testing and Quality Assurance. Van Nastraud
(2) Tourslakis. G, (1984) :Theory of Computation, John Wiley & Sons
(3) Ramoorthy, (1985) :Achieving Quality in Software Proceedings of the 3rd International Conference on Quality In Software.
(4) Zuse (1991): Practicing Software Engineering in the 21st Century, IRM Press, USA
(5) Fenton(1992): Sofware Metrics –A rigorous Approach. Chapman Hall
(6) Akiyama F, ''An example of software system debugging'', Inf Processing 71, 353379,1971.
(7) Cusumano, M. A., “Objectives and Context of Software Measurement, Analysis and Control,” Massachusetts Institute of Technology Sloan School of Management Working Paper 3471-92,
(8) Daskalantonakis, M. K., “A Practical View of Software Measurement and Implementation Experiences Within Motorola,” IEEE Transactions on Software Engineering, Vol. SE-18,1992, pp. 998–1010.