From 8b53232db68f82c9ebe85da8203852206a80b175 Mon Sep 17 00:00:00 2001
From: Rohit Tanwar <31792358+kriadmin@users.noreply.github.com>
Date: Tue, 20 Feb 2018 16:36:12 +0530
Subject: [PATCH] Update insertion_sort.md

---
 snippets/insertion_sort.md | 4 +---
 1 file changed, 1 insertion(+), 3 deletions(-)

diff --git a/snippets/insertion_sort.md b/snippets/insertion_sort.md
index f00e41ce9..6c6625272 100644
--- a/snippets/insertion_sort.md
+++ b/snippets/insertion_sort.md
@@ -1,6 +1,4 @@
-## insertion_sort
-
-### Insertion Sort Algorithm
+### 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!