Guide to Competitive Programming : learning and improving algorithms through contests /

This invaluable textbook presents a comprehensive introduction to modern competitive programming. The text highlights how competitive programming has proven to be an excellent way to learn algorithms, by encouraging the design of algorithms that actually work, stimulating the improvement of programm...

ver descrição completa

Detalhes bibliográficos
Autor principal: Laaksonen, Antti
Formato: Livro
Idioma:English
Publicado em: Cham : Springer : c2017
coleção:Undergraduate Topics in Computer Science
Assuntos:
Classic Catalogue: View this record in Classic Catalogue
LEADER 05153nam a2200457Mi 4500
001 36843
003 BD-DhAAL
005 20200101154620.0
008 200101t2017 gw o 000 0 eng d
999 |c 41789  |d 41789 
020 |a 9783319725468 
020 |a 9783319725475 
020 |a 3319725475 
035 |a (OCoLC)1021187473 
035 |a (OCoLC)1019708993 
040 |a AZU  |b eng  |c AZU  |d OCLCO  |d GW5XE  |d OCLCF  |d BD-DhAAL 
049 |a MYGG 
050 4 |a QA76.6-76.66 
082 0 4 |a 005.1  |2 23 
100 1 |a Laaksonen, Antti  |9 38774 
245 1 0 |a Guide to Competitive Programming :  |b learning and improving algorithms through contests /  |c Antti Laaksonen. 
260 |a Cham :  |b Springer :  |b c2017 
300 |a xii, 283 pages :  |b illustrations ; 
490 1 |a Undergraduate Topics in Computer Science,  |x 1863-7310 
504 |a Includes bibliographical references and index. 
505 0 |a Introduction -- Programming Techniques -- Efficiency -- Sorting and Searching -- Data Structures -- Dynamic Programming -- Graph Algorithms -- Algorithm Design Topics -- Range Queries -- Tree Algorithms -- Mathematics -- Advanced Graph Algorithms -- Geometry -- String Algorithms -- Additional Topics -- Appendix A: Mathematical Background. 
520 |a This invaluable textbook presents a comprehensive introduction to modern competitive programming. The text highlights how competitive programming has proven to be an excellent way to learn algorithms, by encouraging the design of algorithms that actually work, stimulating the improvement of programming and debugging skills, and reinforcing the type of thinking required to solve problems in a competitive setting. The book contains many "folklore" algorithm design tricks that are known by experienced competitive programmers, yet which have previously only been formally discussed in online forums and blog posts. Topics and features: Reviews the features of the C++ programming language, and describes how to create efficient algorithms that can quickly process large data sets Discusses sorting algorithms and binary search, and examines a selection of data structures of the C++ standard library Introduces the algorithm design technique of dynamic programming, and investigates elementary graph algorithms Covers such advanced algorithm design topics as bit-parallelism and amortized analysis, and presents a focus on efficiently processing array range queries Surveys specialized algorithms for trees, and discusses the mathematical topics that are relevant in competitive programming Examines advanced graph techniques, geometric algorithms, and string techniques Describes a selection of more advanced topics, including square root algorithms and dynamic programming optimization This easy-to-follow guide is an ideal reference for all students wishing to learn algorithms, and practice for programming contests. Knowledge of the basics of programming is assumed, but previous background in algorithm design or programming contests is not necessary. Due to the broad range of topics covered at various levels of difficulty, this book is suitable for both beginners and more experienced readers. Dr. Antti Laaksonen has worked as a teacher and researcher at the University of Helsinki and Aalto University, Finland. He has served as one of the organizers of the Finnish Olympiad in Informatics since 2008, and as the Scientific Chair of the Baltic Olympiad in Informatics in 2016. He has also coached and led the Finnish team at several international programming contests, including the International Olympiad in Informatics 2009?2016, and has established experience in teaching programming and algorithms. 
541 |a Karim International  |e 36843, 36844, 36845, 36846, 36847 
650 0 |a Computer science.  |9 38775 
650 0 |a Computer programming.  |9 38776 
650 0 |a Algorithms.  |9 38777 
650 0 |a Education  |x Data processing.  |9 38778 
655 4 |a Electronic books.  |9 38779 
830 |a Undergraduate Topics in Computer Science  |9 38780 
852 |a Ayesha Abed Library  |c General Stacks 
942 |2 ddc  |c BK 
952 |0 0  |1 0  |2 ddc  |4 0  |6 005_100000000000000_LAA  |7 0  |9 67582  |a BRACUL  |b BRACUL  |c GEN  |d 2019-12-29  |e Karim International  |g 3200.00  |l 9  |m 121  |o 005.1 LAA  |p 3010036843  |q 2025-03-03  |r 2025-02-17  |s 2025-02-17  |t 1  |v 3200.00  |w 2019-12-29  |y BK 
952 |0 0  |1 0  |2 ddc  |4 0  |6 005_100000000000000_LAA  |7 0  |9 67583  |a BRACUL  |b BRACUL  |c GEN  |d 2019-12-29  |e Karim International  |g 3200.00  |l 12  |m 85  |o 005.1 LAA  |p 3010036844  |r 2024-12-08  |s 2024-11-06  |t 2  |v 3200.00  |w 2019-12-29  |y BK 
952 |0 0  |1 0  |2 ddc  |4 0  |6 005_100000000000000_LAA  |7 0  |9 67584  |a BRACUL  |b BRACUL  |c GEN  |d 2019-12-29  |e Karim International  |g 3200.00  |l 14  |m 113  |o 005.1 LAA  |p 3010036845  |q 2025-02-16  |r 2024-11-13  |s 2024-11-13  |t 3  |v 3200.00  |w 2019-12-29  |y BK 
952 |0 0  |1 0  |2 ddc  |4 0  |6 005_100000000000000_LAA  |7 0  |9 67585  |a BRACUL  |b BRACUL  |c GEN  |d 2019-12-29  |e Karim International  |g 3200.00  |l 8  |m 67  |o 005.1 LAA  |p 3010036846  |r 2024-11-04  |s 2024-07-07  |t 4  |v 3200.00  |w 2019-12-29  |y BK 
952 |0 0  |1 0  |2 ddc  |4 0  |6 005_100000000000000_LAA  |7 0  |9 67586  |a BRACUL  |b BRACUL  |c GEN  |d 2019-12-29  |e Karim International  |g 3200.00  |l 5  |m 92  |o 005.1 LAA  |p 3010036847  |q 2025-03-02  |r 2024-12-02  |s 2024-12-02  |t 5  |v 3200.00  |w 2019-12-29  |y BK