Sha256: d93fe5f41596348f26a98a7743a6261a68cc1640e69e38bfa48d8a0583b9cb4b
Contents?: true
Size: 1.5 KB
Versions: 53
Compression:
Stored size: 1.5 KB
Contents
# Simple Linked List Write a simple linked list implementation that uses Elements and a List. The linked list is a fundamental data structure in computer science, often used in the implementation of other data structures. They're pervasive in functional programming languages, such as Clojure, Erlang, or Haskell, but far less common in imperative languages such as Ruby or Python. The simplest kind of linked list is a singly linked list. Each element in the list contains data and a "next" field pointing to the next element in the list of elements. This variant of linked lists is often used to represent sequences or push-down stacks (also called a LIFO stack; Last In, First Out). As a first take, lets create a singly linked list to contain the range (1..10), and provide functions to reverse a linked list and convert to and from arrays. When implementing this in a language with built-in linked lists, implement your own abstract data type. To run the tests: ```sh $ gradle test ``` For more detailed info about the Java track see the [help page](http://exercism.io/languages/java). ## Source Inspired by 'Data Structures and Algorithms with Object-Oriented Design Patterns in Ruby', singly linked-lists. [http://www.brpreiss.com/books/opus8/html/page96.html#SECTION004300000000000000000](http://www.brpreiss.com/books/opus8/html/page96.html#SECTION004300000000000000000) ## Submitting Incomplete Solutions It's possible to submit an incomplete solution so you can see how others have completed the exercise.
Version data entries
53 entries across 53 versions & 1 rubygems