Erlang. Упражнения (продолжение). Сортировка.

Exercise 3-6: Sorting Lists

Implement the following sort algorithms over lists:


The head of the list is taken as the pivot; the list is then split according to those
elements smaller than the pivot and the rest. These two lists are then recursively
sorted by quicksort, and joined together, with the pivot between them.

Надо сказать, это очень инетересное упражнение и заставило прилично вникнуть и понять синтаксис и работу erlang. Допускаю, что решение не самое оптимальное, и можно написать вариант быстрее, но мне кажется, что код очень легко читается, воспринимается и позволяет сразу увидеть суть алгоритма:

-module (test_3_6_qsort).
-import (io).

qsort([]) ->

qsort([H | T]) ->	
	{Lesser, Bigger} = filter(H, T, {[], []}),
    qsort(Lesser) ++ [H] ++ qsort(Bigger).

filter(_, [], {Lesser, Bigger}) ->	
	{Lesser, Bigger};

filter(H, [Cur | T], {Lesser, Bigger}) ->  
        H > Cur ->
            filter(H, T, {Lesser ++ [Cur], Bigger});
        true ->
            filter(H, T, {Lesser, Bigger ++ [Cur]})

test() ->    

Site Footer

Sliding Sidebar

About Me

About Me

For whom this blog for?

For those who are interested in modern Internet technologies, IT business, startups, management, quality control, personal effectiveness, motivation. Here I write about what is interesting, about problems I faced and solutions I found. I hope it will be interesting to you either.

What motivates me to write?

The desire to improve, to study deeper topics that interest me. Find people with similar problems and tasks, together look for ways out and solutions.

Feel free to contact if you have anything to say to me

Old Flash site with my artistic works and misuc.