Algorithmic Methods: Brute Force as a Solution Strategy
TechNoLogica · 26.06.2026 · 1 (2) · 15-19
DOI: 10.17268/tech1.2.2026.03 ↗Kurz gefasst
Fachartikel in der Zeitschrift TechNoLogica, online erschienen am 26.06.2026. Verfasst von Bruno Becerra-Gil und 4 weiteren Autor:innen.
Abstract (Originalsprache)
This article aims to understand how brute-force algorithms work to solve problems on computers. It explains what they are, how they function, their advantages and limitations, and how they are used in some well -known problems. These problems include finding divisors of a number, the traveling salesman problem, and searching for patterns in texts. This is done by implementing these algorithms and analyzing their impact on the computer's time and resource requirements. The results show that while these algorithms always find the best solution by testing all possibilities, they are not very efficient when the problem is very large. In short, brute-force algorithms are useful when the problem is not too large or when there are no better methods. However, they are not practical for very complex problems.
Zitieren
APA
Becerra-Gil, B., Cotrina-Lezama, L., Cruz-Lara, M. D. L., Quiroz-Herrera, Y., & Rivera-Chirinos, K. (2026). Algorithmic Methods: Brute Force as a Solution Strategy. TechNoLogica, 1(2), 15-19. https://doi.org/10.17268/tech1.2.2026.03
Vancouver
Becerra-Gil B, Cotrina-Lezama L, Cruz-Lara MDL, Quiroz-Herrera Y, Rivera-Chirinos K. Algorithmic Methods: Brute Force as a Solution Strategy. TechNoLogica. 2026;1(2):15-19. doi:10.17268/tech1.2.2026.03
BibTeX
@article{BecerraGil2026,
author = {Becerra-Gil, Bruno and Cotrina-Lezama, Larry and Cruz-Lara, Maythe De la and Quiroz-Herrera, Yubitza and Rivera-Chirinos, Kevin},
title = {Algorithmic Methods: Brute Force as a Solution Strategy},
journal = {TechNoLogica},
year = {2026},
volume = {1},
number = {2},
pages = {15--19},
doi = {10.17268/tech1.2.2026.03}
}
EUVIMED