From 1b7e4c4b413e0235728f7173ecc651fa9d1e2d2b Mon Sep 17 00:00:00 2001
From: Rohit Tanwar <31792358+kriadmin@users.noreply.github.com>
Date: Tue, 20 Feb 2018 15:07:30 +0530
Subject: [PATCH] Update and rename insertionsort.md to insertion_sort.md

---
 snippets/{insertionsort.md => insertion_sort.md} | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)
 rename snippets/{insertionsort.md => insertion_sort.md} (96%)

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!