Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
topviz
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
3 ms
·
1.
▲
by
topviz
12y ago
Can you give an example of the code you write which is on par with C in terms of speed and is non-trivial? Did you look up the algorithm? (it is perfectly defined recursively) Arguing what is nicer is subjective. To clarify, I did not write
2.
▲
by
topviz
12y ago
Haskell is beautiful and mind-bending, but to get close to C in any non-trivial problem, you will end up writing imperative code. We have 4 implementations of a graph algorithm: a) Idiomatic Haskell takes ~25 minutes b) Monadic Haskell take