Sha256: 8a3a4d32458b01e27a243312f060a373b13d87d4bddc561db34d192e0f016655

Contents?: true

Size: 1.91 KB

Versions: 72

Compression:

Stored size: 1.91 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.

## Running the tests

To run the tests run the command `go test` from within the exercise directory.

If the test suite contains benchmarks, you can run these with the `-bench`
flag:

    go test -bench .

Keep in mind that each reviewer will run benchmarks on a different machine, with
different specs, so the results from these benchmark tests may vary.

## Further information

For more detailed information about the Go track, including how to get help if
you're having trouble, please visit the exercism.io [Go language page](http://exercism.io/languages/go/about).

## 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

72 entries across 72 versions & 1 rubygems

Version Path
trackler-2.2.1.177 tracks/go/exercises/simple-linked-list/README.md
trackler-2.2.1.176 tracks/go/exercises/simple-linked-list/README.md
trackler-2.2.1.175 tracks/go/exercises/simple-linked-list/README.md
trackler-2.2.1.174 tracks/go/exercises/simple-linked-list/README.md
trackler-2.2.1.173 tracks/go/exercises/simple-linked-list/README.md
trackler-2.2.1.172 tracks/go/exercises/simple-linked-list/README.md
trackler-2.2.1.171 tracks/go/exercises/simple-linked-list/README.md
trackler-2.2.1.170 tracks/go/exercises/simple-linked-list/README.md
trackler-2.2.1.169 tracks/go/exercises/simple-linked-list/README.md
trackler-2.2.1.167 tracks/go/exercises/simple-linked-list/README.md
trackler-2.2.1.166 tracks/go/exercises/simple-linked-list/README.md
trackler-2.2.1.165 tracks/go/exercises/simple-linked-list/README.md
trackler-2.2.1.164 tracks/go/exercises/simple-linked-list/README.md
trackler-2.2.1.163 tracks/go/exercises/simple-linked-list/README.md
trackler-2.2.1.162 tracks/go/exercises/simple-linked-list/README.md
trackler-2.2.1.161 tracks/go/exercises/simple-linked-list/README.md
trackler-2.2.1.160 tracks/go/exercises/simple-linked-list/README.md
trackler-2.2.1.159 tracks/go/exercises/simple-linked-list/README.md
trackler-2.2.1.158 tracks/go/exercises/simple-linked-list/README.md
trackler-2.2.1.157 tracks/go/exercises/simple-linked-list/README.md