
Hands-On Data Structures and Algorithms with Python - Third Edition - Basant Agarwal
Descriere
Understand how implementing different data structures and algorithms intelligently can make your Python code and applications more maintainable and efficientKey Features: Explore functional and reactive implementations of traditional and advanced data structuresApply a diverse range of algorithms in your Python codeImplement the skills you have learned to maximize the performance of your applicationsBook Description: Choosing the right data structure is pivotal to optimizing the performance and scalability of applications. This new edition of Hands-On Data Structures and Algorithms with Python will expand your understanding of key structures, including stacks, queues, and lists, and also show you how to apply priority queues and heaps in applications. You'll learn how to analyze and compare Python algorithms, and understand which algorithms should be used for a problem based on running time and computational complexity. You will also become confident organizing your code in a manageable, consistent, and scalable way, which will boost your productivity as a Python developer.By the end of this Python book, you'll be able to manipulate the most important data structures and algorithms to more efficiently store, organize, and access data in your applications.What You Will Learn: Understand common data structures and algorithms using examples, diagrams, and exercisesExplore how more complex structures, such as priority queues and heaps, can benefit your codeImplement searching, sorting, and selection algorithms on number and string sequencesBecome confident with key string-matching algorithmsUnderstand algorithmic paradigms and apply dynamic programming techniquesUse asymptotic notation to analyze algorithm performance with regard to time and space complexitiesWrite powerful, robust code using the latest features of PythonWho this book is for: This book is for developers and programmers who are interested in learning about data structures and algorithms in Python to write complex, flexible programs. Basic Python programming knowledge is expected.
Oferte disponibile
Compara preturile si alege comerciantul potrivit.
Compara alternative
Produse comparate
Alte produse din aceeasi categorie si de acelasi tip. Verifica specificatiile si pretul final la comerciant.


Covoraș De Intrare Din Cocos 40/60 cm
Covoraș De Intrare Din Cocos 40/60 cm


Descopera mai multe
Produse recomandate
Alte produse care pot completa cautarea ta.

Dulap Cu Uși Glisante, 313/208/64 cm, bej, grej
Dulap Cu Uși Glisante, 313/208/64 cm, bej, grej

Dulap Cu Uși Glisante, 313/208/64 cm, grafit, negru
Dulap Cu Uși Glisante, 313/208/64 cm, grafit, negru

Dulap Cu Uși Glisante, 313/208/64 cm, grafit, culoare lemn stejar
Dulap Cu Uși Glisante, 313/208/64 cm, grafit, culoare lemn stejar

Informatii utile
Articole de citit
Sfaturi si ghiduri care completeaza informatiile despre produs.
Ghid practic
Cum alegi elastice de birou: dimensiuni, lățime și utilizare
Birou și organizare Cum alegi elastice de birou: dimensiuni, lățime și utilizare Elasticele de birou pot grupa temporar plicuri, cartonașe sau alte o…
Citeste articolul →Ghid practic
Cum alegi o etichetă pentru bagaj: prindere, material și lizibilitate
Călătorii și accesorii utile Cum alegi o etichetă pentru bagaj: prindere, material și lizibilitate O valiză obișnuită poate semăna cu multe altele, .…
Citeste articolul →Ghid practic
Cum alegi o bara Technique Bar - Ghid complet pentru invatarea tehnicii, fitness si haltere
Cum alegi o bara Technique Bar - Ghid complet pentru invatarea tehnicii, fitness si haltere Technique Bar este o bara special conceputa pentru invata…
Citeste articolul →Ghid practic
Cum alegi o camera endoscop industriala: sonda, articulare, rezolutie si protectie
Cum alegi o camera endoscop industriala: sonda, articulare, rezolutie si protectie Unele produse sunt cumparate pentru o singura problema concreta, i…
Citeste articolul →Istoricul tau
Vizualizate recent
Produsele consultate in acest browser.