Posted
by Linda Cohen
on Stack Overflow
See other posts from Stack Overflow
or by Linda Cohen
Published on 2010-04-30T01:18:45Z
Indexed on
2010/04/30
1:27 UTC
Read the original article
Hit count: 266
turboPower a 0 = 1
turboPower a b
| even b = turboPower (a*a) (b `div` 2)
| otherwise = a * turboPower a (b-1)
THANKS!
© Stack Overflow or respective owner
as seen on Stack Overflow
- Search for 'Stack Overflow'
Trying to learn Haskell. I am trying to write a simple function to remove a number from a list without using built-in function (delete...I think). For the sake of simplicity, let's assume that the input parameter is an Integer and the list is an Integer list. Here is the code I have, Please tell me…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I'm trying to use Haskells Data.Heap module, but I'm incapable of even using it with integers. The only heap I've been capable of using is "empty", which does not take any arguments.
Later on I'll figure out how to instance for my needs, but for now I'd be glad if I was even able to test it with…
>>> More
as seen on Programmers
- Search for 'Programmers'
There has been some intermingling of Scala and Haskell communities, and I have noticed now and then people commenting on stuff that's supposed to be easy in Haskell and hard and Scala. Less often (maybe because I read Scala questions, not Haskell ones), I see someone mentioning that something in Scala…
>>> More
as seen on Programmers
- Search for 'Programmers'
I have problems installing ghc-mod on my linux machine. cabal worries about "happy" not being available in versione = 1.17:
$ cabal install ghc-mod
Resolving dependencies...
[1 of 1] Compiling Main ( /tmp/haskell-src-exts-1.14.0-1357/haskell-src-exts-1.14.0/Setup.hs, /tmp/haskell-src-exts-1…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
fibs :: [Int]
fibs = 0 : 1 : [ a + b | (a, b) <- zip fibs (tail fibs)]
This generates the Fibonacci sequence.
I understand the behaviour of the guards, of :, zip and tail, but I don't understand <-. What is it doing here?
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Can someone show me a simple tail-recursive function in C++?
Why is tail recursion better, if it even is?
What other kinds of recursion are there besides tail recursion?
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hi,
I am really struggling to understand tail recursion in Erlang.
I have the following eunit test:
db_write_many_test() ->
Db = db:new(),
Db1 = db:write(francesco, london, Db),
Db2 = db:write(lelle, stockholm, Db1),
?assertEqual([{lelle, stockholm},{francesco, london}], Db2)…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Can someone give me the difference between these two kinds recursions and example?
specifically in ocaml. Thanks
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Why the following code runs so.... slow....... ?
<html><body><script type="text/javascript">
var i = 0;
f();
function f() {
if (i == 5000) {
document.write("Done");
} else {
i++;
tail();
}
}
function…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I write some code to learning F#.
Here is a example:
let nextPrime list=
let rec loop n=
match n with
| _ when (list |> List.filter (fun x -> x <= ( n |> double |> sqrt |> int)) |> List.forall (fun x -> n % x <> 0)) -> n
| _ -> loop…
>>> More
