[Haskell-cafe] Linear shuffle

[Keean Schupke]

Please see: http://okmij.org/ftp/Haskell/perfect-shuffle.txt

For an explanation of the algorithm.

    Keean.

Ketil Malde wrote:

>Tomasz Zielonka <tomasz.zielonka at gmail.com> writes:
>
>  
>
>>On Fri, Jan 14, 2005 at 09:17:41AM +0100, Gracjan Polak wrote:
>>    
>>
>>>This algorithm seems not effective, length, take, drop and (!!) are 
>>>costly. Is there any better way to implement shuffle?
>>>      
>>>
>
>  
>
>>You can use mutable arrays (modules Data.Array.MArray, Data.Array.IO). 
>>    
>>
>
>But is that better, really?  IIUC, you will now need to shift the first
>part of the string to the right, so it's still a linear operation for
>each shuffle.
>
>-kzm
>  
>