000			04792nam a2200553Mi 4500
999			_c41789 _d41789
001			36843
003			BD-DhAAL
005			20200101154620.0
008			200101t2017 gw o 000 0 eng d
020			_a9783319725468
020			_a9783319725475
020			_a3319725475
035			_a(OCoLC)1021187473
035			_a(OCoLC)1019708993
040			_aAZU _beng _cAZU _dOCLCO _dGW5XE _dOCLCF _dBD-DhAAL
049			_aMYGG
050		4	_aQA76.6-76.66
082	0	4	_a005.1 _223
100	1		_aLaaksonen, Antti _938774
245	1	0	_aGuide to Competitive Programming : _blearning and improving algorithms through contests / _cAntti Laaksonen.
260			_aCham : _bSpringer : _bc2017
300			_axii, 283 pages : _billustrations ;
490	1		_aUndergraduate Topics in Computer Science, _x1863-7310
504			_aIncludes bibliographical references and index.
505	0		_aIntroduction -- 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			_aThis 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.
650		0	_aComputer science. _938775
650		0	_aComputer programming. _938776
650		0	_aAlgorithms. _938777
650		0	_aEducation _xData processing. _938778
655		4	_aElectronic books. _938779
830			_aUndergraduate Topics in Computer Science _938780
852			_aAyesha Abed Library _cGeneral Stacks
942			_2ddc _cBK