Anonymous user
Talk:Dutch national flag problem: Difference between revisions
→Haskell entry opening paragraph - better without it?
Line 34:
:::Yes. (3||.@/:)^:(-:/:~)@:? first tries to generate values independently of each other, then it tests to see if they are sorted. If they are sorted, it generates a red,white,blue,red,white... sequence of the same length as the original sequence, and then reverses it. This "eliminate random values which are sorted" thing seems to be a dubious requirement though, for the test data -- as near as I can tell the main thing it accomplishes is allowing sort implementations which are broken when the data is already sorted. --[[User:Rdm|Rdm]] 13:28, 2 July 2012 (UTC)
== Haskell entry opening paragraph - better without it? ==
It starts:
:''This problem is very easy to solve in Haskell. No algorithms necessary, because Haskell provides everything we need.''
I think that how easy it is to solve in Haskell might depend on the Haskell programmer. It doesn't seem to be the easiest or smallest Haskell solution to any task which don't come with that statement.<br>
The Haskell program ''does'' describe an algorithm for solution.<br>The third part of the sentence shows a love of the language, but adds no real 'meat'. <br>I propose the deletion of the first paragraph as adding little to the example as a whole. --[[User:Paddy3118|Paddy3118]] 07:30, 30 August 2012 (UTC)
| |||