Binary search algorithm for natural number targets

Senad Orhani

doi:10.35335/jbst.v11i3.3549

Penulis

Senad Orhani University of Prishtina

DOI:

https://doi.org/10.35335/jbst.v11i3.3549

Kata Kunci:

Binary Search Algorithm, Natural Number, Targets, Python, Pseudocode

Abstrak

Targeting the number thought in a list is a common problem in computer science and is commonly implemented with the search algorithm. Numerical math games are a big thing for all of us. One of the really challenging games is targeting the number thought by the opponent. Therefore, the purpose of our study is to find the desired number through the binary search algorithm. For this study, we developed a pseudocode in the Python programming language, which gives the desired result followed after several successful steps. Our study results show that the algorithm was very efficient in solving the problem of finding the intended natural.

Referensi

Christodoulou, M., Szczygiel, E., & Klapa, ?. (2018). Algorithmic and Programming. PTEA Wszechnica Sp. z o. o

Knuth, D. (1998). Sorting and Searching. The Art of Computer Programming, 3(2).

Krishna, A. (2022, 01 11). Search Algorithms – Linear Search and Binary Search Code Implementation and Complexity Analysis. Retrieved from FreeCodeCamp: https://www.freecodecamp.org/news/search-algorithms-linear-and-binary-search-explained/

Mahdi, A. Y. (2013). Algorithm Flow Charts. Retrieved from Faradars: https://faradars.org/wp-content/uploads/2015/07/algorithm-and-flow-chart.pdf

Meghanathan, N. (2015). Module 1: Analyzing the Efficiency of Algorithms. Jackson State University.

Reys, RE, Suydam, MN, & Lindquist, MM (1984). Helping Children Learn Mathematics. London: Prentice-Hall International, Inc.

Sugandhi, A. (2022). Binary Search Algorithm with Example Code. Retrieved from Knowledge Hut: https://www.knowledgehut.com/blog/programming/binary-search-algorithm