Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/752
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLaaksonen, Antti-
dc.date.accessioned2026-10-16T10:25:53Z-
dc.date.available2026-10-16T10:25:53Z-
dc.date.issued2017-
dc.identifier.isbn978-3-319-72547-5-
dc.identifier.issn978-3-319-72546-8-
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/752-
dc.description279 pages : illustrations, includes an indexen_US
dc.description.abstracthis book provides a comprehensive introduction to competitive programming and algorithmic problem-solving techniques. It explores fundamental and advanced algorithms used to solve computational problems efficiently, covering programming techniques, algorithm efficiency, sorting and searching, data structures, dynamic programming, graph algorithms, tree algorithms, mathematical concepts, computational geometry, and string processing. The book also discusses algorithm analysis, problem complexity, and techniques for improving programming and debugging skills. Through practical examples and contest-based problem-solving approaches, it helps readers develop logical reasoning, computational thinking, and the ability to design and implement efficient solutions. It is a valuable resource for computer science students, programmers, and individuals preparing for programming competitionsen_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.relation.ispartofseriesUndergraduate Topics in Computer Science;-
dc.subjectCompetitive programmingen_US
dc.subjectomputer algorithmsen_US
dc.subjectAlgorithm designen_US
dc.subjectProblem solvingen_US
dc.titleGuide to Competitive Programming:en_US
dc.title.alternativeLearning and Improving Algorithms Through Contestsen_US
dc.typeBooken_US
Appears in Collections:ICT

Files in This Item:
File Description SizeFormat 
Guide to Competitive Programming.pdf10.44 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.