Interesting functional language Haskell

I recently saw an interview with Dave Thomas on TSS. He mentioned the Haskell language. I saw it very attractive. Many of the famous American universities begin with functional Language LISP, but I feel that lisp is not easy to learn. Looking at the brackets, I feel dizzy. Haskell is easy to get started, the language is named after a computer scientist.

Compared with the quick sorting in the upper-right cornerAlgorithmYou will know the benefits.
This language is closer to the algorithm itself and mathematics. It is far more advantageous to get rid of the annoying details.

Quicksort in Haskell

 
Qsort [] = [] qsort (X: XS) = qsort elts_lt_x ++ [x] ++ qsort elts_greq_x where elts_lt_x = [Y | Y <-xs, Y <X] elts_greq_x = [Y | Y <-xs, Y> = x]
 

Quicksort in C

 qsort (A, lo, hi) int A [], hi, lo; {int H, L, P, T; If (Lo 
  
    L) & (A [H]> = p) H = h-1; If (L 
   
     reference 
    
 http://www.haskell.org/