Quarterly Journal of Information and Communication Technology ​

Investigating Operational and Practical Classifications of Algorithmic Perspectives in Computer Science

Document Type : Original Research Article

Author

Department of Computer Science, Islamic Azad University, Kermanshah Branch, Kermanshah, Iran

Abstract
In today's knowledge-oriented world, there are many problems that need to be solved in a structured and systematic way. In this regard, an effective solution is to use suitable algorithmic approaches and perspectives. Algorithm includes a set of processes and instructions that can be used to solve many computer problems or real world problems in a regular and effective way. The use of algorithms in solving systematic problems saves time and money and provides new and valuable solutions. In fact, the algorithm is considered the beating heart of potentially powerful technologies such as artificial intelligence and today, instead of thinking about the future of algorithms, people consider the future to belong to algorithms. Although algorithms have relatively the same concept in different fields of implementation, but in order to achieve specific applications of the desired algorithm in different fields, we must take advantage of the approaches and perspectives of appropriate algorithms. Therefore, according to the importance of the subject, in this article, we intend to investigate the different dimensions of algorithmic perspectives and describe the common operational and practical classifications of important algorithms in computer science and related technology-oriented fields.

Keywords


[1] Panneerselvam R. Design and Analysis of Algorithms. PHI Learning Pvt. Ltd.; 2016.
[2] Kabat MR. Design and analysis of algorithms. PHI Learning Pvt. Ltd.; 2013 Aug 21.
[3] Dimri SC, Malik P, Ram M. Algorithms: Design and Analysis. Walter de Gruyter GmbH & Co KG; 2021 Mar 8.
[4] Gupta P, Agarwal V, Varshney M. Design and analysis of algorithms. PHI Learning Pvt. Ltd.; 2012 Dec 9.
[5] Kimani CJ, Scott J. Introduction to Algorithms Professional Level. Finstock Evarsity Publishers; 2023 Aug 7.
[6] Laaksonen A. Guide to competitive programming. Cham: Springer; 2020.
[7] Basu SK. Design methods and analysis of algorithms. PHI Learning Pvt. Ltd.; 2013 Apr 17.
[8] Alsalmi AA. A comparative analysis of searching algorithms. Journal of University Studies for inclusive Research. 2020;1(1):1-6.
[9] Puntambekar AA. Analysis and Design of Algorithms. Technical Publications; 2020 Dec 1.
[10] Horowitz E. Algorithms, design and classification of. InEncyclopedia of Computer Science 2003 Jan 1 (pp. 45-51).
[11] Borodin A. Further reflections on a theory for basic algorithms. InInternational Conference on Algorithmic Applications in Management 2006 Jun 20 (pp. 1-9). Berlin, Heidelberg: Springer Berlin Heidelberg.
[12] Ganapathi P. Automatic discovery of efficient divide-&-conquer algorithms for dynamic programming problems (Doctoral dissertation, State University of New York at Stony Brook).
[13] Huang CY, Lai CY, Cheng KT. Fundamentals of algorithms. InElectronic design automation 2009 Jan 1 (pp. 173-234). Morgan Kaufmann.
[14] Alsuwaiyel MH. Algorithms: design techniques and analysis. World Scientific; 2021 Nov 8.
[15] Erciyes K. Guide to graph algorithms: sequential, parallel and distributed. Springer; 2018 Apr 13.
[16] Erickson J. Algorithms. 2023 Jul 21.
[17] Levitin A, Levitin M. Algorithmic puzzles. Oxford University Press; 2011 Oct 12.
[18] Jena SR, Patro S. Design and Analysis of Algorithms. University Science Press, Laxmi Publications, New Delhi; 2018 Jul 21.
[19] Benoit A, Robert Y, Vivien F. A guide to algorithm design: paradigms, methods, and complexity analysis. CRC Press; 2013 Aug 27.
[20] McConnell J. Analysis of algorithms. Jones & Bartlett Publishers; 2007 Nov 2.
[21] Abdullah AS, Shree TA, Priyadharshini P, Saranya T. Algorithm and design techniques–a survey. Global Journal of Computer Science and Technology. 2019.