Competitive Programming in Python

Dekorationsartikel gehören nicht zum Leistungsumfang.

Sprache: Englisch

50,90 €

inkl. MwSt.

Versandkostenfrei per Post / DHL

Aktuell nicht verfügbar

Kategorien:

Beschreibung

Want to kill it at your job interview in the tech industry? Want to win that coding competition? Learn all the algorithmic techniques and programming skills you need from two experienced coaches, problem setters, and jurors for coding competitions. The authors highlight the versatility of each algorithm by considering a variety of problems and show how to implement algorithms in simple and efficient code. Readers can expect to master 128 algorithms in Python and discover the right way to tackle a problem and quickly implement a solution of low complexity. Classic problems like Dijkstra's shortest path algorithm and Knuth-Morris-Pratt's string matching algorithm are featured alongside lesser known data structures like Fenwick trees and Knuth's dancing links. The book provides a framework to tackle algorithmic problem solving, including: Definition, Complexity, Applications, Algorithm, Key Information, Implementation, Variants, In Practice, and Problems. Python code included in the book and on the companion website.

Über den Autor

Christoph Dürr is a senior researcher at the French National Center for Scientific Research (CNRS), affiliated with the Sorbonne University in Paris. After a PhD in 1996 at Paris-Sud University, he worked as for one year as a postdoc at the International Computer Science Institute in Berkeley and one year in the School of Computer Science and Engineering in the Hebrew University of Jerusalem in Israel. He has worked in the fields of quantum computation, discrete tomography, algorithmic game theory, and his current research activity focuses on algorithms and optimisation. From 2007 to 2014, he taught a preparation course for programming contests at the engineering school École Polytechnique, and acts regularly as a problem setter, trainer, or competitor for various coding competitions. In addition, he loves carrot cake.

Inhaltsverzeichnis

1. Introduction; 2. Character strings; 3. Sequences; 4. Arrays; 5. Intervals; 6. Graphs; 7. Cycles in graphs; 8. Shortest paths; 9. Matching and flows; 10. Trees; 11. Sets; 12. Points and polygons; 13. Rectangles; 14. Numbers and matrices; 15. Exhaustive search; 16. Conclusion.

Details

Erscheinungsjahr:	2020
Fachbereich:	Programmiersprachen
Genre:	Importe , Informatik
Rubrik:	Naturwissenschaften & Technik
Medium:	Taschenbuch
Inhalt:	Kartoniert / Broschiert
ISBN-13:	9781108716826
ISBN-10:	1108716822
Sprache:	Englisch
Einband:	Kartoniert / Broschiert
Autor:	Dürr, Christoph Vie, Jill-Jênn
Übersetzung:	Gibbons, Greg Gibbons, Daniele
Hersteller:	Cambridge University Press
Verantwortliche Person für die EU:	Libri GmbH, Europaallee 1, D-36244 Bad Hersfeld, gpsr@libri.de
Maße:	244 x 170 x 15 mm
Von/Mit:	Christoph Dürr (u. a.)
Erscheinungsdatum:	17.12.2020
Gewicht:	0,465 kg