Livrare gratuită pentru comenzile peste 349,00 lei.

Verifică starea comenzii

Faceți parte dintr-o comunitate de iubitori de cărți din întreaga lume și beneficiați de o mulțime de avantaje Creați-vă un cont gratuit

Transport gratuit la punctele de livrare Pick Up peste 349.00 lei

Packeta 15.00 lei Serviciul de curierat Cargus 28.00 lei Easybox 20.00 lei FAN Courier 20.00 lei Punct FAN 16.00 lei Punct DPD 17.00 lei Curier Sameday 24.00 lei Curier DPD 25.00 lei

Contact

Cum să cumpăr

Ajutor

Contul meu

▸ Gol :-(

Livrare gratuită pentru comenzile peste 349,00 lei.

How to Think About Algorithms

Name: How to Think About Algorithms
Brand: Cambridge University Press
SKU: 04093317
Price: 307.96 RON
Availability: PreOrder
Author: Jeff Edmonds
ISBN: 9780521614108

Jeff Edmonds

Limba

engleză

Carte Carte broșată

Codul Libristo: 04093317

Editura Cambridge University Press, mai 2008

This textbook, for second- or third-year students of computer science, presents insights, notations,... Descrierea completă

Codul Libristo: 04093317

143 b

Curând

307.96 lei

Retipărire preconizată

Termenul este necunoscut

Până la 30 de zile pentru returnare

Clienții au cumpărat de asemenea

Taweel Al Ayat Vol 1 Wilayat Mission

Carte broșată

81.39 lei

Rolle des Grals in der Schwanrittergeschichte in Konrads 'Der Schwanritter' und Wolframs 'Parzival' Manuela Gallina

Carte broșată

89.37 lei

Mass Customization - Ist das noch Marke oder schon Produkt? Christoph Beaufils

Carte broșată

246.78 lei

Frauen- und Männerstereotype in der Werbung Ramon Klein

Carte broșată

89.37 lei

This textbook, for second- or third-year students of computer science, presents insights, notations, and analogies to help them describe and think about algorithms like an expert, without grinding through lots of formal proof. Solutions to many problems are provided to let students check their progress, while class-tested PowerPoint slides are on the web for anyone running the course. By looking at both the big picture and easy step-by-step methods for developing algorithms, the author guides students around the common pitfalls. He stresses paradigms such as loop invariants and recursion to unify a huge range of algorithms into a few meta-algorithms. The book fosters a deeper understanding of how and why each algorithm works. These insights are presented in a careful and clear way, helping students to think abstractly and preparing them for creating their own innovative ways to solve problems.