| 000 | a | ||
|---|---|---|---|
| 999 |
_c31268 _d31268 |
||
| 008 | 220916b xxu||||| |||| 00| 0 eng d | ||
| 020 | _a9781788995573 | ||
| 082 |
_a005.133 _bAGA |
||
| 100 | _aAgarwal, Basant | ||
| 245 | _aHands-on data structures and algorithms with Python : write complex and powerful using the latest features of Python 3.7 | ||
| 250 | _a2nd ed. | ||
| 260 |
_bPackt Publishing, _c2018 _aBirmingham : |
||
| 300 |
_a380 p. ; _bill., _c25 cm |
||
| 365 |
_b2799.00 _cINR _d01 |
||
| 520 | _aData structures allow you to store and organize data efficiently. They are critical to any problem, provide a complete solution, and act like reusable code. Hands-On Data Structures and Algorithms with Python teaches you the essential Python data structures and the most common algorithms for building easy and maintainable applications. This book helps you to understand the power of linked lists, double linked lists, and circular linked lists. You will learn to create complex data structures, such as graphs, stacks, and queues. As you make your way through the chapters, you will explore the application of binary searches and binary search trees, along with learning common techniques and structures used in tasks such as preprocessing, modeling, and transforming data. In the concluding chapters, you will get to grips with organizing your code in a manageable, consistent, and extendable way. You will also study how to bubble sort, selection sort, insertion sort, and merge sort algorithms in detail. By the end of the book, you will have learned how to build components that are easy to understand, debug, and use in different applications. You will get insights into Python implementation of all the important and relevant algorithms. | ||
| 650 | _aQuerying | ||
| 650 | _aComputer science | ||
| 650 | _aComputer logic | ||
| 650 | _aData structures | ||
| 650 | _aPython Programming | ||
| 650 | _aAmortized analysis | ||
| 650 | _aAsymptotic analysis | ||
| 650 | _aBinary search tree | ||
| 650 | _a Bubble sort algorithms | ||
| 650 | _a Coin-counting problem | ||
| 650 | _a Depth-first search | ||
| 650 | _a Interpolation search | ||
| 650 | _a Iterative function | ||
| 650 | _aKnuth-Morris-Pratt (KMP) algorithm | ||
| 650 | _aList-based queues | ||
| 650 | _a Media player queues | ||
| 650 | _aNode-based queues | ||
| 650 | _aOrdered linear search | ||
| 650 | _aPattern matching algoorithms | ||
| 650 | _aPython environment | ||
| 650 | _aQueue | ||
| 650 | _aRecursive function | ||
| 650 | _aStrings | ||
| 650 | _a Tuples | ||
| 650 | _a Traveling salesman problem | ||
| 650 | _a Unsupervised learning | ||
| 700 | _aBaka, Benjamin | ||
| 942 |
_2ddc _cBK |
||