PTT
Submit
Submit
選擇語言
正體中文
简体中文
PTT
PLT
Generating all permutations of a list in Haskell
作者:
slyfox
(klanloss)
2010-06-21 22:02:28
I was tracing the code from:
http://shivindap.wordpress.com/2009/01/12/permutations-of-a-list-in-haskell/
but got confused by:
permutation [1]
= [ 1 : permutation [] ]
= [ 1 : [[]] ]
where did i go wrong? Thanks.
繼續閱讀
Re: [心得] Y Combinator 與 Mutual Recursion
scwg
Re: [心得] Y Combinator 與 Mutual Recursion
xcycl
[閒聊] a scheme intermpreter writen in Perl
dryman
Re: [心得] Y Combinator 與 Mutual Recursion
noctem
Re: [心得] Y Combinator 與 Mutual Recursion
scwg
Re: [心得] Y Combinator 與 Mutual Recursion
SansWord
[心得] Y Combinator 與 Mutual Recursion
noctem
Re: [問題] letrec 為何可以成立? (In scheme, ma …
SansWord
Re: [問題] letrec 為何可以成立? (In scheme, ma …
noctem
Re: [問題] letrec 為何可以成立? (In scheme, ma …
noctem
Links
booklink
Contact Us: admin [ a t ] ucptt.com