https://github.com/brandaoplaster/recursion_challenge
Recursively calculate how many elements are in the list and return that value
https://github.com/brandaoplaster/recursion_challenge
elixir
Last synced: about 1 year ago
JSON representation
Recursively calculate how many elements are in the list and return that value
- Host: GitHub
- URL: https://github.com/brandaoplaster/recursion_challenge
- Owner: brandaoplaster
- Created: 2021-03-23T12:14:50.000Z (about 5 years ago)
- Default Branch: main
- Last Pushed: 2021-03-24T00:27:00.000Z (about 5 years ago)
- Last Synced: 2025-02-03T23:43:16.486Z (over 1 year ago)
- Topics: elixir
- Language: Elixir
- Homepage:
- Size: 1.95 KB
- Stars: 0
- Watchers: 3
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Recursion Challenge
Create a function that, given a list of numbers (example **[1, 3, 6, 43, 6]**),
recursively calculate how many elements are in the list and return that value.
## Installation
If [available in Hex](https://hex.pm/docs/publish), the package can be installed
by adding `recursion_challenge` to your list of dependencies in `mix.exs`:
```elixir
def deps do
[
{:recursion_challenge, "~> 0.1.0"}
]
end
```
Documentation can be generated with [ExDoc](https://github.com/elixir-lang/ex_doc)
and published on [HexDocs](https://hexdocs.pm). Once published, the docs can
be found at [https://hexdocs.pm/recursion_challenge](https://hexdocs.pm/recursion_challenge).