Clojure Data Structures and Algorithms Cookbook

Chapter 1. Revisiting Arrays

In this chapter, we will see how you can use array abstractions in Clojure to cover the following topics:

• Efficiently compressing a byte array
• Using Pascal's triangle to draw fractals
• Simulating multithreading using time-sharing
• Simulating a call stack using arrays

Introduction

In this book, we will go on a journey through the broad land of algorithms and data structures, taking a ride on the comfortable vehicle that is Clojure programming language.

First, we will take a look at arrays, exploring their particular structures to tackle problems as interesting as compression, fractal drawing, multithreading, and call stacks.

Then we will elaborate on linked lists, transforming them in to doubly linked lists. We will do this to ...