30 Dec
                
                    2013
                
            
            
                30 Dec
                
                '13
                
            
            
            
        
    
                6:03 p.m.
            
        On 31 December 2013 09:57, David Banas 
I just posted v0.0.4 of *treeviz*, a Haskell package for visualizing how various divide & conquer algorithms break down computations. The specific example provided is the classic fast Fourier transform (FFT).
http://hackage.haskell.org/package/treeviz-0.0.4 https://github.com/capn-freako/treeviz
sounds good, do you have some example output?
Conrad.