Ruby Data Structures and Algorithms

Data Structures and Algorithms


A concise introduction to data structures and algorithms in Ruby. Data structures are presented in a container hierarchy that includes stacks and queues as non-traversable dispensers, and lists, sets, and maps as traversable collections. Algorithm analysis is introduced and applied to linear and binary search, bubble sort, selection sort, insertion sort, merge sort and quicksort. The book also covers heaps and heapsort, unbalanced binary search trees, AVL trees, 2-3 trees, hashing, graph representations, and graph algorithms based on depth-and breadth-first search.


  1.  Introduction
  2.   Built-In Types
  3.   Containers
  4.   Assertions
  5.   Stacks
  6.   Queues
  7.   Stacks and Recursion
  8.   Collections and Iterators
  9.   Lists
  10.   Analyzing Algorithms
  11.   Function Growth Rates
  12.   Basic Sorting Algorithms
  13.   Recurrences
  14.   Merge Sort and Quicksort
  15.   Trees, Heaps, and Heapsort
  16.   Binary Trees
  17.   Binary Search and Binary Search Trees
  18.   AVL Trees
  19.   2–3 Trees
  20.   Sets
  21.   Maps
  22.   Hashing
  23.   Hashed Collections
  24.   Graphs
  25.   Graph Algorithms

You can also get this PDF by using our Android Mobile App directly:


Please enter your comment!
Please enter your name here

This site uses Akismet to reduce spam. Learn how your comment data is processed.