Skip to main content
Have a personal or library account? Click to login
Clojure Data Structures and Algorithms Cookbook Cover

Clojure Data Structures and Algorithms Cookbook

25 recipes to deeply understand and implement advanced algorithms in Clojure

Publisher:Packt Publishing Limited
Paid access
|Oct 2025
Product purchase options
Description

Key Features

    Book Description

    Data-structures and algorithms often cross your path when you compress files, compile programs, access databases, or simply use your favourite text editor. Understanding and implementing them can be daunting. Curious learners and industrial developers can find these complex, especially if they focus on the detailed implementation of these data structures.
    Clojure is a highly pragmatic and expressive language with efficient and easy data manipulation capabilities. As such, it is great for implementing these algorithms. By abstracting away a great share of the unnecessary complexity resulting from implementation, Clojure and its contrib libraries will help you address various algorithmic challenges, making your data exploration both profitable and enjoyable.
    Through 25 recipes, you'll explore advanced algorithms and data-structures, well served by a sound Clojure implementation.
    This book opens with an exploration of alternative uses of the array data-structure, covering LZ77 compression, drawing fractals using Pascal's triangles, simulating a multi-threaded program execution, and implementing a call-stack winding and un-winding operations.
    The book elaborates on linked lists, showing you how to construct doubly linked ones, speed up search times over the elements of such structures, use a linked-list as the foundation of a shift-reduce parser, and implement an immutable linked-list using skew binary numbers representation.
    After that, the tree data-structure is explored, focusing on building self-balancing Splay Trees, designing a B-Tree backing-up an efficient key-value data-store, constructing an undo capable Rope, and showing how Tries can make for an auto-completing facility.
    Next, some optimization and machine learning techniques are discussed, namely for building a co-occurrence-based recommendation engine, using branch-and-bound to optimize integral cost and profit problems, using Dijkstra's algorithm to determine optimal paths and summarizing texts using the LexRank algorithm.
    Particular attention is given to logic programming, you will learn to use this to discover interesting relations between social website data, by designing a simple type inferencer for a mini Java-like language, and by building a simple checkers game engine.
    Asynchronous programming will be addressed and you will design a concurrent web-crawler, an interactive HTML5 game, and an online taxi booking platform.
    Finally, you'll explore advanced cases for higher order functions in Clojure while implementing a recursive descent parser using efficient mutual resucrsion, devising a mini resusable firewall simulator thanks to Clojure 1.7 new tansducers feature or building a simple unification engine with the help of Continuation Passing Style.

    What you will learn

    • Explore alternative uses of classical data structures such as arrays and linked lists
    • Explore advanced machine learning and optimization techniques
    • Utilize the Clojure libraries, such as Instaparse for parsing, core.match for pattern matching, clojure.zip for zippers, and clojure.matrix for matrix operations
    • Learn logic programming through the core.logic library
    • Master asynchronous programming using the core.async library
    • Observe transducers while resolving realworld use cases

    Who this book is for

    This book is for intermediate Clojure developers who can read and write in this language quite comfortably. Besides, it is assumed that you have some knowledge of how to set up Clojure projects, include dependencies, how to run REPLs, and so on through Leiningen and Figwheel. No prior awareness of any of the algorithms covered in this book is needed, and, when appropriate, pointers are given to the explanation material about any theory related to them.

    Table of Contents

    1. Revisiting the Arrays
    2. Building on Linked Lists
    3. Walking Down Forests of Data
    4. Making Decisions with Science
    5. Programming with Logic
    6. Sharing by Communicating
    7. Transformations as First-Class Citizens
    PDF ISBN: 978-1-78528-782-4
    Publisher: Packt Publishing Limited
    Copyright owner: © 2015 Packt Publishing Limited
    Publication date: 2025
    Language: English
    Pages: 216
    Related subjects:
    General interest

    People also read

    Clojure Programming Cookbook
    Book

    Clojure Programming Cookbook

    Mastering Clojure
    Book

    Mastering Clojure

    Akhil Wali
    Clojure for Java Developers
    Book

    Clojure for Java Developers

    The Clojure Workshop
    Book
    Coming soon

    The Clojure Workshop

    Joseph Fahey Fahey, Thomas Haratyk Haratyk, Scott McCaughie McCaughie
    Clojure: High Performance JVM Programming
    Book

    Clojure: High Performance JVM Programming

    Eduardo Díaz, Shantanu Kumar, Akhil Wali
    Clojure: High Performance JVM Programming
    Book

    Clojure: High Performance JVM Programming

    Eduardo Díaz, Shantanu Kumar, Akhil Wali
    Clojure for Data Science
    Book

    Clojure for Data Science

    Mastering Clojure Data Analysis
    Book

    Mastering Clojure Data Analysis

    Clojure High Performance Programming, Second Edition
    Book

    Clojure High Performance Programming, Second Edition

    Clojure Data Analysis Cookbook - Second Edition
    Book

    Clojure Data Analysis Cookbook - Second Edition