Exercise: Programming language ages revisited

Lets take the programming language ages exercise and use a collection for the ages. Does this change how we work with the numbers?

The programming language ages in a vector collection:

[10 27 26 21 22 22 45 34 59 60].


Find the age of the youngest programming language

How could you find the smallest number?

The ages are not in order, so you cant just get the first value.

If only the values were sorted...

()
Reveal answer...
(first (sort [10 27 26 21 22 22 45 34 59 60]))

We could also use a function called count to get the total number of ages. The total value is then used to divide all the ages by. The more languages we have, the more useful a collection becomes.

(/ (+ 10 27 26  21 22 22 45 34 59 60)
   (count [10 27 26  21 22 22 45 34 59 60]))

The min function will simplify our expression

(min [10 27 26 21 22 22 45 34 59 60])

There are over 600 functions in clojure.core so there is often a function you are looking for to simplify you code

results matching ""

    No results matching ""