From dc76f610f8ddc877c21dd8237f337893cebaa11a Mon Sep 17 00:00:00 2001 From: Meet Zaveri Date: Tue, 20 Feb 2018 15:53:05 +0530 Subject: [PATCH] Update insertion_sort.md --- snippets/insertion_sort.md | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/snippets/insertion_sort.md b/snippets/insertion_sort.md index 6c6625272..f00e41ce9 100644 --- a/snippets/insertion_sort.md +++ b/snippets/insertion_sort.md @@ -1,4 +1,6 @@ -### insertion_sort +## insertion_sort + +### Insertion Sort Algorithm 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!