Last active
June 9, 2017 01:55
-
-
Save thiagoa/247b625fa0883346ed78ed2f425473bb to your computer and use it in GitHub Desktop.
Naive and Effective Bubble Sort in Elixir
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
defmodule NaiveBubbleSort do | |
def call([]), do: [] | |
def call(list), do: call(list, 0, length(list) - 1, true) | |
def call(list, idx, last_idx, false) when last_idx == idx, do: list |> call | |
def call(list, idx, last_idx, true) when last_idx == idx, do: list | |
def call(list, idx, last_idx, done) do | |
{a, b} = values_to_compare(list, idx) | |
{list, done} = process(list, idx, a, b, done) | |
list |> call(idx + 1, last_idx, done) | |
end | |
defp values_to_compare(list, idx) do | |
{Enum.at(list, idx), Enum.at(list, idx + 1)} | |
end | |
defp process(list, idx, a, b, _done) when a > b do | |
{list |> swap_values(idx, a, b), false} | |
end | |
defp process(list, _idx, _a, _b, done), do: {list, done} | |
defp swap_values(list, idx, a, b) do | |
list |> List.replace_at(idx + 1, a) |> List.replace_at(idx, b) | |
end | |
end | |
defmodule BubbleSort do | |
def call([]), do: [] | |
def call(list), do: call(list, [], true) | |
def call([a, b | list], acc, _) when a > b, do: call([a | list], [b | acc], false) | |
def call([a, b | list], acc, done), do: call([b | list], [a | acc], done) | |
def call([a], acc, true), do: [a | acc] |> Enum.reverse | |
def call([a], acc, false), do: [a | acc] |> Enum.reverse |> call | |
end | |
# TESTS # | |
defmodule BubbleSortSharedTests do | |
defmacro __using__(opts) do | |
quote do | |
use ExUnit.Case | |
@moduletag unquote(opts) | |
test "sorts empty collections", %{sorter: sorter} do | |
assert sorter.call([]) == [] | |
end | |
test "sorts a collection of one element", %{sorter: sorter} do | |
assert sorter.call([1]) == [1] | |
end | |
test "sorts a collection of two elements", %{sorter: sorter} do | |
assert sorter.call([2, 1]) == [1, 2] | |
end | |
test "sorts collections of many elements", %{sorter: sorter} do | |
list = (1..500) |> Enum.shuffle | |
assert sorter.call(list) == Enum.to_list(1..500) | |
end | |
end | |
end | |
end | |
defmodule NaiveBubbleSortTest do | |
use BubbleSortSharedTests, sorter: NaiveBubbleSort | |
end | |
defmodule BubbleSortTest do | |
use BubbleSortSharedTests, sorter: BubbleSort | |
end | |
# Benchmarking BubbleSort... | |
# Benchmarking NaiveBubbleSort... | |
# | |
# Name ips average deviation median | |
# BubbleSort 239.12 K 4.18 μs ±238.18% 4.00 μs | |
# NaiveBubbleSort 1.55 K 644.86 μs ±3.16% 639.00 μs | |
# | |
# Comparison: | |
# BubbleSort 239.12 K | |
# NaiveBubbleSort 1.55 K - 154.20x slower |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment