Investigate the Performance of Various Searching Techniques Using C++ and Python

Teoh, Yi Xi (2022) Investigate the Performance of Various Searching Techniques Using C++ and Python. Final Year Project (Bachelor), Tunku Abdul Rahman University College.

Text Teoh Yi Xi.pdf Restricted to Registered users only Download (5MB)

Abstract

A collection of data may be analyzed using a variety of search techniques to solve a lot of problems in different fields. This research project presents techniques that are the most well-known and often utilized among the searching techniques such as linear search, binary search, jump search, and interpolation search. Each searching algorithm is valuable and powerful, but each has its own set of issues. This project goes through the details of how searching techniques operate by using a long list of data. Besides, those searching techniques written in Python and C++ will be analyzed based on their speed performance. Python is faster than C++ due to the former’s smaller size code. The overall good performance in the various cases in 8-bit data, 16-bit data, 32bit-data, and string data is Linear Search in Python, Interpolation Search in Python, Jump Search in Python, and Binary Search in Python respectively. The CPU usage will affect the performance of the searching algorithm, especially in big size of data. Different software producers produce different quality compilers/interpreters. The MinGW compiler and interpreter have better quality than Microsoft Visual C++ Compiler and Pylance Interpreter, hence resulting in better speed performance.