Apress | Programming Algorithms In Lisp: Writing Efficient Programs With Examples In ANSI Common Lisp (2021 EN)

Discussion in 'Programming' started by Kanka, Jun 22, 2021.

  1. Kanka

    Kanka Well-Known Member Loyal User

    Messages:
    16,395
    Likes Received:
    485
    Trophy Points:
    83
    [​IMG]

    Author: Vsevolod Domkin
    Full Title: Programming Algorithms In Lisp: Writing Efficient Programs With Examples In ANSI Common Lisp
    Publisher: Apress; 1st ed. edition (January 29, 2021)
    Year: 2021
    ISBN-13: 9781484264287 (978-1-4842-6428-7), 9781484264270 (978-1-4842-6427-0)
    ISBN-10: 1484264282, 1484264274
    Pages: 377
    Language: English
    Genre: Educational: Programming
    File type: EPUB (True), PDF (True), Code Files
    Quality: 10/10
    Price: 29.95 €


    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.


    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

    Features:
    ✓ 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

    Who This Book Is For:
    Intermediate Lisp programmers wanting to do algorithms programming. A very experienced non-Lisp programmer may be able to benefit from this book as well.

    -------------
     
    Last edited by a moderator: Mar 8, 2022