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.
Edition
Language
Place of publication
Target group
Professional and scholarly
Illustrations
26 s/w Abbildungen
XIII, 377 p. 26 illus.
Dimensions
Height: 254 mm
Width: 178 mm
Thickness: 22 mm
Weight
ISBN-13
978-1-4842-6427-0 (9781484264270)
DOI
10.1007/978-1-4842-6428-7
Schweitzer Classification
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.
