Programming Algorithms in Lisp

2 min read Original article ↗

Overview

Authors:
  1. Vsevolod Domkin
    1. Kyiv, Ukraine

  • The first book on Common Lisp algorithms programming
  • Includes practical use cases of the applications of the algorithms to a variety of real-world problems
  • Shows real-world engineering considerations and constraints

Access this book

Log in via an institution

Other ways to access

About this book

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.  

Similar content being viewed by others

Table of contents (15 chapters)

  1. Arrays

    • Vsevolod Domkin

    Pages 41-73

  2. Trees

    • Vsevolod Domkin

    Pages 153-190

  3. Graphs

    • Vsevolod Domkin

    Pages 191-216

  4. Strings

    • Vsevolod Domkin

    Pages 217-250

Back to top

Authors and Affiliations

  • Kyiv, Ukraine

    Vsevolod Domkin

About the author

Vsevolod Domkin from Kyiv, Ukraine is a Lisp programmer and enthusiast, a natural language processing researcher, an occasional writer/blogger, and a teacher.

Accessibility Information

Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.

Bibliographic Information

Keywords

Publish with us

Back to top