Erlang的算法-（二）合并排序/归并排序

可从这里了解合并排序/归并排序的思想
http://blog.csdn.net/touch_2011/article/details/6785881
http://blog.csdn.net/feixiaoxing/article/details/6846008

直接上Erlang的代码

%% -------------
%% 合并排序/归并排序
%% -------------

-module(merge_sort).
-compile(export_all).

merge(Left, Right) ->
    merge(Left, Right, []).

merge([T1|L1], [T2|_L2]=L2, R) when T1 < T2 -> merge(L1, L2, R++[T1]);
merge([_|_]=L1, [T2|L2], R) -> merge(L1, L2, R++[T2]);
merge([], L2, R) -> R++L2;
merge(L1, [], R) -> R++L1;
merge([], [], R) -> R.

merge_sort([]) -> [];
merge_sort([T]) -> [T];
merge_sort(L) ->
    M = trunc(length(L)  / 2),
    {RawLeft, RawRight} = lists:split(M, L),
    Left = merge_sort(RawLeft),
    Right = merge_sort(RawRight),
    merge(Left, Right).

测试结果
10> merge_sort:merge_sort([2,6,8,11,30,1,3,8,10,20,60]).
[1,2,3,6,8,8,10,11,20,30,60]
11> merge_sort:merge_sort([2,6,8,30,1000,3213,213,1,113,228,10,20,60]).
[1,2,6,8,10,20,30,60,113,213,228,1000,3213]