Algorithms Illuminated. Part 1: The Basics
Par :Formats :
- Paiement en ligne :
- Livraison à domicile ou en point Mondial Relay entre le 1 juillet et le 8 juilletCet article sera commandé chez un fournisseur et sera expédié 6 à 12 jours après la date de votre commande.
- Retrait Click and Collect en magasin gratuit
- Livraison à domicile ou en point Mondial Relay entre le 1 juillet et le 8 juillet
- Réservation en ligne avec paiement en magasin :
- Indisponible pour réserver et payer en magasin
- Nombre de pages213
- PrésentationBroché
- FormatGrand Format
- Poids0.38 kg
- Dimensions15,2 cm × 22,9 cm × 1,4 cm
- ISBN978-0-9992829-0-8
- EAN9780999282908
- Date de parution27/09/2017
- ÉditeurSOUNDLIKEYOURSELF PUBLISHING,
Résumé
Algorithms are the heart and soul of computer science. Their applications range from network routing and computational genomics to public-key cryptography and machine learning. Studying algorithms can make you a better programmer, a clearer thinker, and a master of technical interviews. Algorithms Illuminated is an accessible introduction to the subject-a transcript of what an expert algorithms tutor would say over a series of one-on-one lessons.
Part 1 covers asymptotic analysis and big-O notation, divide-and-conquer algorithms and the master method, randomized algorithms, and several famous algorithms for sorting and selection.
Part 1 covers asymptotic analysis and big-O notation, divide-and-conquer algorithms and the master method, randomized algorithms, and several famous algorithms for sorting and selection.
Algorithms are the heart and soul of computer science. Their applications range from network routing and computational genomics to public-key cryptography and machine learning. Studying algorithms can make you a better programmer, a clearer thinker, and a master of technical interviews. Algorithms Illuminated is an accessible introduction to the subject-a transcript of what an expert algorithms tutor would say over a series of one-on-one lessons.
Part 1 covers asymptotic analysis and big-O notation, divide-and-conquer algorithms and the master method, randomized algorithms, and several famous algorithms for sorting and selection.
Part 1 covers asymptotic analysis and big-O notation, divide-and-conquer algorithms and the master method, randomized algorithms, and several famous algorithms for sorting and selection.