A THEORETICAL AND PRACTICAL EXAMINATION OF ALGORITHMIC EFFICIENCY IN CONTEMPORARY COMPUTER SCIENCE PROBLEMS

Indhu Arumugam

Authors

Indhu Arumugam Cybersecurity Analyst Author

Keywords:

Algorithmic efficiency, computational complexity, asymptotic analysis, empirical performance, optimization, time complexity, Big-O notation, algorithm design, computing, data structures

Abstract

This paper investigates algorithmic efficiency from both theoretical and practical perspectives in the context of emerging computational challenges up to the year . By evaluating classical computational models and contrasting them with empirical performance data from modern algorithmic applications, this study reveals the gaps between asymptotic analysis and real-world behavior. Furthermore, it assesses improvements in algorithm design driven by hardware advances and algorithmic paradigms such as parallelism and heuristic methods.

References

Aho, Alfred V. Foundations of Computer Science: C Edition. W. H. Freeman, 2006.

Sheta, S.V. (2022). An Overview of Object-Oriented Programming (OOP) and Its Impact on Software Design. Educational Administration: Theory and Practice, 28(4), 409–419.

Bentley, Jon. Programming Pearls. Addison-Wesley, 1986.

Cormen, Thomas H., et al. Introduction to Algorithms. 3rd ed., MIT Press, 2009.

Daskalakis, Constantinos, and Christos H. Papadimitriou. “Computing Equilibria in Markets and Games.” ACM SIGACT News, vol. 39, no. 1, 2009, pp. 69–84.

Sheta, S.V. (2020). Enhancing Data Management in Financial Forecasting with Big Data Analytics. International Journal of Computer Engineering and Technology (IJCET), 11(3), 73–84.

Hopcroft, John E., and Jeffrey D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.

Knuth, Donald E. The Art of Computer Programming: Volume 1. Addison-Wesley, 1974.

Sheta, S.V. (2022). A Study on Blockchain Interoperability Protocols for Multi-Cloud Ecosystems. International Journal of Information Technology and Electrical Engineering, 11(1), 1–11. https://ssrn.com/abstract=5034149

Leiserson, Charles E., et al. “The Problem with Threads.” IEEE Computer, vol. 45, no. 5, 2012, pp. 34–42.

McGeoch, Catherine C. “Toward an Experimental Method for Algorithm Simulation.” INFORMS Journal on Computing, vol. 3, no. 1, 1991, pp. 50–67.

Papadimitriou, Christos H. Computational Complexity. Addison-Wesley, 1994.

Sedgewick, Robert. Algorithms. 4th ed., Addison-Wesley, 2011.

Tarjan, Robert E. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, 1983.

Sheta, S.V. (2021). Security Vulnerabilities in Cloud Environments. Webology, 18(6), 10043–10063.

Garey, Michael R., and David S. Johnson. Computers and Intractability. W.H. Freeman, 1979.

Goldberg, David E. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, 1989.

Lamport, Leslie. “LaTeX: A Document Preparation System.” Addison-Wesley, 1994.

Amdahl, Gene M. “Validity of the Single Processor Approach to Achieving Large-Scale Computing Capabilities.” AFIPS Conference Proceedings, vol. 30, 1967, pp. 483–485.

Sheta, S.V. (2019). The Role and Benefits of Version Control Systems in Collaborative Software Development. Journal of Population Therapeutics and Clinical Pharmacology, 26(3), 61–76. https://doi.org/10.53555/hxn1xq28