# Assignment for Crossbeam

## The Challenge
You are given a list of tasks, some of which depend on others. Write a function which will takes a subset of those tasks and returns an ordered list of all the tasks to run.

## My Algorithm
My algorithm appends dependancies using a recursive function

This treats the dependancies like a tree. By treating these like a tree, the recursive algorithm traverses down the tree, then comes back up, appending each node along the way

## Testing
Tests several sets of tasks by looking at a ", " seperated string from the array
Uses the string "undefined" to determine an error occured

# To Run
Running `make` will spin up a docker instance and run crossbeam.lisp using sibilant

## Clean Up
Run `make clean` to delete all contianers and images created by the run