diff --git a/README.md b/README.md
index dab17d97c..421a8f82e 100644
--- a/README.md
+++ b/README.md
@@ -233,7 +233,7 @@ difference_by([{ 'x': 2 }, { 'x': 1 }], [{ 'x': 1 }], lambda v : v['x']) # [ { x
On a very basic level, an insertion sort algorithm contains the logic of shifting around and inserting elements in order to sort an unordered list of any size. The way that it goes about inserting elements, however, is what makes insertion sort so very interesting!
```py
-def insertionsort(arr):
+def insertion_sort(arr):
for i in range(1, len(arr)):
key = arr[i]
diff --git a/tag_database b/tag_database
index d542f2886..b3ba59a8f 100644
--- a/tag_database
+++ b/tag_database
@@ -22,5 +22,4 @@ is_upper_case:string
is_lower_case:string
count_by:list
difference_by:list
-insertion_sort:list
-
+insertion_sort:list
\ No newline at end of file
diff --git a/test/average/average.test.py b/test/average/average.test.py
index 040e8c52c..0ee26a2e7 100644
--- a/test/average/average.test.py
+++ b/test/average/average.test.py
@@ -3,4 +3,5 @@ from pytape import test
from average import average
def average_test(t):
t.true(isinstance(average, (types.BuiltinFunctionType, types.FunctionType, functools.partial)),'average is a function')
+ t.equal(2,2,'equal')
test('Testing average',average_test)
\ No newline at end of file
diff --git a/test/insertion_sort/insertion_sort.py b/test/insertion_sort/insertion_sort.py
index 393b52b0d..1d2771675 100644
--- a/test/insertion_sort/insertion_sort.py
+++ b/test/insertion_sort/insertion_sort.py
@@ -1,4 +1,4 @@
-def insertionsort(arr):
+def insertion_sort(arr):
for i in range(1, len(arr)):
key = arr[i]
diff --git a/website/index.html b/website/index.html
deleted file mode 100644
index cac34cd3f..000000000
--- a/website/index.html
+++ /dev/null
@@ -1,10 +0,0 @@
-
-
-
-
-
-