Why read boring descriptions of algorithms and wade through a jumble of formulas? Practical examples and humorous explanations will allow you to instantly grasp the most complex problems, while humor and beautiful illustrations will keep you from "falling asleep" over...
the book. It's like reading short stories or trying to solve a puzzle, all while understanding the essence of algorithms and appreciating their beauty. The algorithms covered in the book include various sorting methods, brute force, depth-first and breadth-first search, graph traversal, four shortest path algorithms, two minimum spanning tree algorithms, algorithms for determining cut vertices and edges, as well as finding the maximum matching in bipartite graphs and much more.
Why read boring descriptions of algorithms and wade through a jumble of formulas? Practical examples and humorous explanations will allow you to instantly grasp the most complex problems, while humor and beautiful illustrations will keep you from "falling asleep" over the book. It's like reading short stories or trying to solve a puzzle, all while understanding the essence of algorithms and appreciating their beauty. The algorithms covered in the book include various sorting methods, brute force, depth-first and breadth-first search, graph traversal, four shortest path algorithms, two minimum spanning tree algorithms, algorithms for determining cut vertices and edges, as well as finding the maximum matching in bipartite graphs and much more.
Pirmieji sužinokite apie mūsų taikomas nuolaidas, pasiūlymus ir naujus produktus!
Check icon
Jūs pridėjote į savo krepšelį
Check icon
Įtraukėte į mėgstamiausius
Išparduota
Šiuo metu nėra sandėlyje
Yra sandėlyje
Turima sandėlyje Rygoje. Tikslų pristatymo laiką nurodys operatorius po užsakymo patvirtinimo.
Užsisakyti
Prekė tiekiami tiesiogiai iš leidyklos. Užsakymo įvykdymo terminas – iki 14 dienų, tikslią pristatymo datą gausite iš operatoriaus po užsakymo patvirtinimo.