Sha256: d53cab37bceb58923fa41efa20a0ca48696f94308790d86cf935246d52ab49a2

Contents?: true

Size: 1.83 KB

Versions: 51

Compression:

Stored size: 1.83 KB

Contents

# Collatz Conjecture

The Collatz Conjecture or 3x+1 problem can be summarized as follows:

Take any positive integer n. If n is even, divide n by 2 to get n / 2. If n is
odd, multiply n by 3 and add 1 to get 3n + 1. Repeat the process indefinitely.
The conjecture states that no matter which number you start with, you will
always reach 1 eventually.

Given a number n, return the number of steps required to reach 1.

## Examples

Starting with n = 12, the steps would be as follows:

0. 12
1. 6
2. 3
3. 10
4. 5
5. 16
6. 8
7. 4
8. 2
9. 1

Resulting in 9 steps. So for input n = 12, the return value would be 9.

## Getting Started

Make sure you have read the
[C page](http://exercism.io/languages/c) on the Exercism site. This covers
the basic information on setting up the development environment expected
by the exercises.


## Passing the Tests

Get the first test compiling, linking and passing by following the [three
rules of test-driven development][3-tdd-rules].

The included makefile can be used to create and run the tests using the `test`
task.

    make test

Create just the functions you need to satisfy any compiler errors and get the
test to fail. Then write just enough code to get the test to pass. Once you've
done that, move onto the next test.

[3-tdd-rules]: http://butunclebob.com/ArticleS.UncleBob.TheThreeRulesOfTdd

As you progress through the tests, take the time to refactor your
implementation for readability and expressiveness and then go on to the next
test.

Try to use standard C99 facilities in preference to writing your own
low-level algorithms or facilities by hand.

## Source

Wikipedia [https://en.wikipedia.org/wiki/Collatz_conjecture](https://en.wikipedia.org/wiki/Collatz_conjecture)

## Submitting Incomplete Solutions
It's possible to submit an incomplete solution so you can see how others have completed the exercise.

Version data entries

51 entries across 51 versions & 1 rubygems

Version Path
trackler-2.2.1.104 tracks/c/exercises/collatz-conjecture/README.md
trackler-2.2.1.103 tracks/c/exercises/collatz-conjecture/README.md
trackler-2.2.1.102 tracks/c/exercises/collatz-conjecture/README.md
trackler-2.2.1.101 tracks/c/exercises/collatz-conjecture/README.md
trackler-2.2.1.100 tracks/c/exercises/collatz-conjecture/README.md
trackler-2.2.1.99 tracks/c/exercises/collatz-conjecture/README.md
trackler-2.2.1.98 tracks/c/exercises/collatz-conjecture/README.md
trackler-2.2.1.97 tracks/c/exercises/collatz-conjecture/README.md
trackler-2.2.1.96 tracks/c/exercises/collatz-conjecture/README.md
trackler-2.2.1.95 tracks/c/exercises/collatz-conjecture/README.md
trackler-2.2.1.94 tracks/c/exercises/collatz-conjecture/README.md
trackler-2.2.1.93 tracks/c/exercises/collatz-conjecture/README.md
trackler-2.2.1.92 tracks/c/exercises/collatz-conjecture/README.md
trackler-2.2.1.91 tracks/c/exercises/collatz-conjecture/README.md
trackler-2.2.1.90 tracks/c/exercises/collatz-conjecture/README.md
trackler-2.2.1.89 tracks/c/exercises/collatz-conjecture/README.md
trackler-2.2.1.88 tracks/c/exercises/collatz-conjecture/README.md
trackler-2.2.1.87 tracks/c/exercises/collatz-conjecture/README.md
trackler-2.2.1.86 tracks/c/exercises/collatz-conjecture/README.md
trackler-2.2.1.85 tracks/c/exercises/collatz-conjecture/README.md