Скачать или смотреть Merge Sort Evaluation

This video shows the evaluation of the merge sort function on an unsorted list of numbers.

http://en.wikipedia.org/wiki/Merge_sort

The fibonacci numbers are a well known sequence where fib(n) = fib(n-1) + fib(n-2). The sequence can also be defined by the following expression:

fibs = 0, 1, zipWith(+, fibs, tail fibs)

"zipWith" is a function that takes two lists and applies a function to the elements of each. Basically, this function takes the fibonacci sequence and pairs it up with itself, pushed back one element.

CToast is a .NET windows application that evaluates and renders mathematical expressions. The code is available here: https://github.com/mp1011/CToast