• A Comparative Study of Algorit...

Treffer: A Comparative Study of Algorithmic Problem-Solving Techniques in Competitive Programming

Title:
A Comparative Study of Algorithmic Problem-Solving Techniques in Competitive Programming
Authors:
Muxitdinova, Asila
Publisher Information:
Zenodo
Publication Year:
2025
Collection:
Zenodo
Subject Terms:
Algorithms, Dynamic Programming, Brute Force, Greedy Algorithms, History of Algorithms, Backtracking, Divide and Conquer, Competitive Programming
Document Type:
other/unknown material
Language:
English
Relation:
https://zenodo.org/records/16788673; oai:zenodo.org:16788673; https://doi.org/10.5281/zenodo.16788673
DOI:
10.5281/zenodo.16788673
Availability:
https://doi.org/10.5281/zenodo.16788673
https://zenodo.org/records/16788673
Rights:
Creative Commons Attribution 4.0 International ; cc-by-4.0 ; https://creativecommons.org/licenses/by/4.0/legalcode ; CC BY (Attribution)
Accession Number:
edsbas.C085237
Database:
BASE

Weitere Informationen

This article provides insights into competitive programming and its significance. It includes a historical overview of the origin of key algorithms and discusses various algorithmic approaches to solve different types of programming problems, highlighting their uniqueness, strengths, and limitations. The article presents examples from the LeetCode platform for each algorithmic paradigm to help readers understand both their advantages and weaknesses. Finally, it offers a broad perspective on future trends and research directions in the field.