Programming Algorithms in Lisp
Writing Efficient Programs with Examples in ANSI Common Lisp
Seiten
2021
|
1st ed.
Apress (Verlag)
978-1-4842-6427-0 (ISBN)
Apress (Verlag)
978-1-4842-6427-0 (ISBN)
Master algorithms programming using Lisp, including the most important data structures and algorithms. This book also covers the essential tools that help in the development of algorithmic code to give you all you need to enhance your code.
Programming Algorithms in Lisp shows real-world engineering considerations and constraints that influence the programs that use these algorithms. It includes practical use cases of the applications of the algorithms to a variety of real-world problems.
What You Will Learn
Program algorithms using the Lisp programming language
Work with data structures, arrays, key-values, hash-tables, trees, graphs, and more
Use dynamic programming
Program using strings
Work with approximations and compression
Who This Book Is For
Intermediate Lisp programmers wanting to do algorithms programming. A very experienced non-Lisp programmer may beable to benefit from this book as well.
Programming Algorithms in Lisp shows real-world engineering considerations and constraints that influence the programs that use these algorithms. It includes practical use cases of the applications of the algorithms to a variety of real-world problems.
What You Will Learn
Program algorithms using the Lisp programming language
Work with data structures, arrays, key-values, hash-tables, trees, graphs, and more
Use dynamic programming
Program using strings
Work with approximations and compression
Who This Book Is For
Intermediate Lisp programmers wanting to do algorithms programming. A very experienced non-Lisp programmer may beable to benefit from this book as well.
Vsevolod Domkin from Kyiv, Ukraine is a Lisp programmer and enthusiast, a natural language processing researcher, an occasional writer/blogger, and a teacher.
1: Introduction.- 2: Algorithmic Complexity.- 3: A Crash Course in Lisp.- 4: Essential Data Structures.- 5: Arrays.- 6: Linked Lists.- 7: Key-Values.- 8: Derivative Data Structures.- 9: Trees.- 10: Graphs.- 11: Strings.- 12: Selected Algorithms.- 13: Approximation.- 14: Compression.- 15: Synchronization.- Afterword.
| Erscheinungsdatum | 05.02.2021 |
|---|---|
| Zusatzinfo | 26 Illustrations, black and white; XIII, 377 p. 26 illus. |
| Verlagsort | Berkley |
| Sprache | englisch |
| Maße | 178 x 254 mm |
| Themenwelt | Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge |
| Mathematik / Informatik ► Informatik ► Theorie / Studium | |
| Mathematik / Informatik ► Mathematik ► Analysis | |
| Schlagworte | algorithms • ANSI • Code • Common Lisp • Debugging • LISP • multi-threading • Open Source • Programming language • source |
| ISBN-10 | 1-4842-6427-4 / 1484264274 |
| ISBN-13 | 978-1-4842-6427-0 / 9781484264270 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Das Handbuch für Webentwickler
Buch | Hardcover (2023)
Rheinwerk (Verlag)
CHF 69,85
Grundlagen und praktische Anwendungen von Transpondern, kontaktlosen …
Buch (2023)
Hanser (Verlag)
CHF 125,95
