An Effective Approach to Analyze Algorithms with Linear O(n) Worst-Case Asymptotic Complexity
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2019, Vol 10, Issue 3
Abstract
A theoretical approach of asymptote analyzes the algorithms for approximate time complexity. The worst-case asymptotic complexity classifies an algorithm to a certain class. The asymptotic complexity for algorithms returns the degree variable of the algorithmic function while ignores the lower terms. In perspective of programming, asymptote only considers the number of iterations in a loop ignoring inside and outside statements. However, every statement must have some execution time. This paper provides an effective approach to analyze the algorithms belonging to the same class of asymptotes. The theoretical analysis of algorithmic functions shows that the difference between theoretical outputs of two algorithmic functions depends upon the difference between their coefficient of ‘n’ and the constant term. The said difference marks the point for the behavioral change of algorithms. This theoretic analysis approach is applied to algorithms with linear asymptotic complexity. Two algorithms are considered having a different number of statements outside and inside the loop. The results positively indicated the effectiveness of the proposed approach as the tables and graphs validates the results of the derived formula.
Authors and Affiliations
Qazi Haseeb Yousaf, Muhammad Arif Shah, Rashid Naseem, Karzan Wakil, Ghufran Ullah
Keywords
Related Articles
- EP ID EP499543
- DOI 10.14569/IJACSA.2019.0100344
- Views 83
- Downloads 0
Improvement of Control System Performance by Modification of Time Delay
This paper presents a mathematical approach for improving the performance of a control system by modifying the time delay at certain operating conditions. This approach converts a continuous time loop into a discrete tim...
Divide and Conquer Approach for Solving Security and Usability Conflict in User Authentication
Knowledge based authentication schemes are divided into textual password schemes and graphical password schemes. Textual password schemes are easy to use but have well known security issues, such as weak against online s...
A Hybrid Approach for Co-Channel Speech Segregation based on CASA, HMM Multipitch Tracking, and Medium Frame Harmonic Model
This paper proposes a hybrid approach for co-channel speech segregation. HMM (hidden Markov model) is used to track the pitches of 2 talkers. The resulting pitch tracks are then enriched with the prominent pitch. The enr...
Improved Accuracy of PSO and DE using Normalization: an Application to Stock Price Prediction
Data Mining is being actively applied to stock market since 1980s. It has been used to predict stock prices, stock indexes, for portfolio management, trend detection and for developing recommender systems. The various al...
Fairness Enhancement Scheme for Multimedia Applications in IEEE 802.11e Wireless LANs
Multimedia traffic should be transmitted to a receiver within the delay bound. The traffic is discarded when breaking its delay bound. Then, QoS (Quality of Service) of the traffic and network performance are lowered. Th...