Research Article

Experimental Performance Benchmarking of Popular Search Algorithms in Java and Python

by 
journal cover
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 187 - Issue 62
Published: December 2025
Authors:
10.5120/ijca2025926016
PDF

. Experimental Performance Benchmarking of Popular Search Algorithms in Java and Python. International Journal of Computer Applications. 187, 62 (December 2025), 31-38. DOI=10.5120/ijca2025926016

                        @article{ 10.5120/ijca2025926016,
                        author  = {  },
                        title   = { Experimental Performance Benchmarking of Popular Search Algorithms in Java and Python },
                        journal = { International Journal of Computer Applications },
                        year    = { 2025 },
                        volume  = { 187 },
                        number  = { 62 },
                        pages   = { 31-38 },
                        doi     = { 10.5120/ijca2025926016 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }
                        %0 Journal Article
                        %D 2025
                        %T Experimental Performance Benchmarking of Popular Search Algorithms in Java and Python%T 
                        %J International Journal of Computer Applications
                        %V 187
                        %N 62
                        %P 31-38
                        %R 10.5120/ijca2025926016
                        %I Foundation of Computer Science (FCS), NY, USA
Abstract

Search algorithms form the backbone of computer science applications ranging from information retrieval and artificial intelligence to database management and network optimization. Although their theoretical complexities are well studied, practical performance can vary significantly depending on the choice of programming language and runtime environment. This study presents a comparative performance analysis of widely used search algorithms Linear Search, Binary Search, Depth-First Search (DFS), Breadth-First Search (BFS), and A Search* are implemented in two popular programming languages: Java and Python. The analysis focuses on measuring execution time across varying dataset sizes and graph structures to highlight differences in efficiency, scalability, and runtime behavior. Empirical results demonstrate that while Java generally outperforms Python in computation-intensive tasks due to its compiled nature and Just-In-Time (JIT) optimizations, exceptions arise in certain cases. The findings of this research emphasize that performance cannot be judged solely on algorithmic theory; instead, language characteristics, data structures, memory models, and runtime environments play crucial roles in determining practical efficiency. The study concludes with insights into the suitability of Java versus Python for algorithm-intensive applications, offering guidance for researchers, educators, and software developers in selecting the right combination of algorithm and language for performance-critical systems.

References
  • Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. 2009. Introduction to algorithms (3rd ed.). The MIT Press.
  • Rios, L. H. O., & Chaimowicz, L. 2010. A survey and classification of A*-based best-first heuristic search algorithms. In Advances in artificial intelligence – SBIA 2010 (pp. 253–262). Springer Berlin Heidelberg.
  • Chowdhary, K. R. 2020. Heuristic search. In Fundamentals of artificial intelligence (pp. 239–272). Springer India.
  • Gosling, J., Joy, B., Steele, G., Bracha, G., Buckley, A., Smith, D., & Bierman, G. 2025. The Java® Language Specification: Java SE 25 Edition.
  • Hetland, M. L. 2014. Python algorithms: Mastering basic algorithms in the Python language. Apress.
  • Wang, Y. 2023. Runtime comparative analysis of Java and Python programs with algorithms of different time complexities. Bradley University.
  • Durrani, O. K., & Abdulhayan, S. 2022. Performance measurement of popular sorting algorithms implemented using Java and Python.
  • Goodrich, M. T., Tamassia, R., & Goldwasser, M. H. 2013. Data Structures and Algorithms in Python. Wisley.
  • Khoirom, S., Sonia, M., Laikhuram, B., Laishram, J., & Singh, T. D. 2020. Comparative analysis of Python and Java for beginners. International Research Journal of Engineering and Technology (IRJET), 7(8).
  • Cutting, V., & Stephen, N. 2022. Comparative review of Java and Python. International Journal of Research and Development in Applied Science and Engineering (IJRDASE).
  • Naveed, M. S. 2024. Pedagogical suitability: A software metrics-based analysis of Java and Python. ResearchGate.
Index Terms
Computer Science
Information Sciences
No index terms available.
Keywords

Search Algorithms Linear Search Binary Search Depth-First Search (DFS) Breadth-First Search (BFS) Java Python Time Complexity Space Complexity Algorithm Optimization. Comparative Study Runtime Analysis

Powered by PhDFocusTM