diff --git a/snippets/insertionsort.md b/snippets/insertion_sort.md
similarity index 96%
rename from snippets/insertionsort.md
rename to snippets/insertion_sort.md
index cbf6c2442..6c6625272 100644
--- a/snippets/insertionsort.md
+++ b/snippets/insertion_sort.md
@@ -1,4 +1,4 @@
-### Insertion Sort
+### insertion_sort
 
 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!