|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 187 - Issue 62 |
| Published: December 2025 |
| Authors: |
10.5120/ijca2025926016
|
. 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
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.