<br><br><div class="gmail_quote">2009/3/27 Edward Z. Yang <span dir="ltr"><<a href="mailto:ezyang@mit.edu">ezyang@mit.edu</a>></span><br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
Hello all,<br>
</blockquote><div><br>Hi <br> <br></div><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;"><br>
average :: Fractional a => [a] -> a<br>
average list = sum list / fromIntegral (length list)<br>
</blockquote><div><br>There was a thread on this ML which was about an implementation of average which avoids<br>traversing the list twice, one for 'sum' and one for 'length'. You could use it, if you care for<br>
performance and your list is long enough to matter <br><br>Ciao<br>----------<br>FB <br><br><br></div></div><br>