From 01add73569519728cf3ec7618e51638abb2d3e66 Mon Sep 17 00:00:00 2001 From: Rohit Tanwar Date: Wed, 21 Feb 2018 13:13:20 +0530 Subject: [PATCH] update insertion sort --- snippets/insertion_sort.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/snippets/insertion_sort.md b/snippets/insertion_sort.md index 1d2e912a5..798c3062f 100644 --- a/snippets/insertion_sort.md +++ b/snippets/insertion_sort.md @@ -3,7 +3,7 @@ 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! ```python -def insertionsort(arr): +def insertion_sort(arr): for i in range(1, len(arr)): key = arr[i]