000			a
999			_c31287 _d31287
008			220916b xxu||||| |||| 00| 0 eng d
020			_a9781786467355
082			_a005.133 _bBAK
100			_aBaka, Benjamin
245			_aPython data structures and algorithms : improve the performance and speed of your applications
260			_bPackt Publishing, _c2017 _aBirmingham :
300			_a292 p. ; _bill., _c25 cm
365			_b3199.00 _cINR _d1
520			_aImplement classic and functional data structures and algorithms using Python About This Book A step by step guide, which will provide you with a thorough discussion on the analysis and design of fundamental Python data structures. Get a better understanding of advanced Python concepts such as big-o notation, dynamic programming, and functional data structures. Explore illustrations to present data structures and algorithms, as well as their analysis, in a clear, visual manner. Who This Book Is For The book will appeal to Python developers. A basic knowledge of Python is expected. What You Will Learn Gain a solid understanding of Python data structures. Build sophisticated data applications. Understand the common programming patterns and algorithms used in Python data science. Write efficient robust code. In Detail Data structures allow you to organize data in a particular way efficiently. They are critical to any problem, provide a complete solution, and act like reusable code. In this book, you will learn the essential Python data structures and the most common algorithms. With this easy-to-read book, you will be able to understand the power of linked lists, double linked lists, and circular linked lists. You will be able to create complex data structures such as graphs, stacks and queues. We will explore the application of binary searches and binary search trees. You will learn the common techniques and structures used in tasks such as preprocessing, modeling, and transforming data. We will also discuss how to organize your code in a manageable, consistent, and extendable way. The book will explore in detail sorting algorithms such as bubble sort, selection sort, insertion sort, and merge sort. By the end of the book, you will learn how to build components that are easy to understand, debug, and use in different applications. Style and Approach The easy-to-read book with its fast-paced nature will improve the productivity of Python programmers and improve the performance of Python applications. Downloading the example code for this book. You can download the example code files for all Packt books you have purchased from your account at http://www.PacktPub.com. If you purchased this book elsewhere, you can visit http://www.PacktPub.com/support and register to have the code file.
650			_aApplication software Development
650			_aProgramming Languages
650			_aElectronic books
650			_aLangage de programmation
650			_aArray module
650			_aBinary search tree
650			_aBubble sort
650			_aBuilt-in data types
650			_aData visualizazation
650			_aDoubly linked list
650			_aGreedy algorithms
650			_a Hash table
650			_aInterpolation search
650			_aKaratsuba algorithm
650			_a Merge sort algorithm
650			_aNumPy
650			_a Pointer structures
650			_aQuick sort
650			_aRecursive functions
650			_aTuple
942			_2ddc _cBK