diff --git a/lib/util.ex b/lib/util.ex
index d1877e9..af710e6 100644
--- a/lib/util.ex
+++ b/lib/util.ex
@@ -14,26 +14,4 @@ defmodule Omnibot.Util do
   def denotify_nick(nick) do
     String.graphemes(nick) |> Enum.join("\u200b")
   end
-
-  def binary_search([], _key) do
-    nil
-  end
-
-  def binary_search([{key, value} | _], key) do
-    {0, value}
-  end
-
-  @doc "Attempts to find to find the given key in a sorted associative array."
-  def binary_search(list, key) do
-    {head, tail} = Enum.split(list, trunc(length(list) / 2))
-    [{mid, _} | _] = tail
-    if key < mid do
-      binary_search(head, key)
-    else
-      case binary_search(tail, key) do
-        nil -> nil
-        {index, item} -> {index + length(head), item}
-      end
-    end
-  end
 end
diff --git a/test/util_test.exs b/test/util_test.exs
index 9987a07..d7921e5 100644
--- a/test/util_test.exs
+++ b/test/util_test.exs
@@ -12,21 +12,4 @@ defmodule Omnibot.UtilTest do
     assert Util.string_or_nil("") == nil
     assert Util.string_or_nil("asdf") == "asdf"
   end
-
-  test "binary_search" do
-    indexes = 0..10 |> Enum.to_list()
-    values = indexes |> Enum.map(&({&1, &1 * 2}))
-    assert Enum.map(indexes, &(Util.binary_search(values, &1))) == values
-
-    indexes = 0..101 |> Enum.to_list()
-    values = indexes |> Enum.map(&({&1, &1 * 2}))
-    assert Enum.map(indexes, &(Util.binary_search(values, &1))) == values
-
-    values = [a: 15, b: 22, c: -1, d: 0]
-
-    assert Util.binary_search(values, :a) == {0, 15}
-    assert Util.binary_search(values, :b) == {1, 22}
-    assert Util.binary_search(values, :c) == {2, -1}
-    assert Util.binary_search(values, :d) == {3, 0}
-  end
 end