From 3b9ae3d786bc26838a88210de361f7c543b287ea Mon Sep 17 00:00:00 2001
From: Nathan-Abegaz <33362510+Nathan-Abegaz@users.noreply.github.com>
Date: Tue, 12 Feb 2019 23:46:58 -0800
Subject: [PATCH] Best/Average/Worst Case Details (#23956)

* Best/Average/Worst Case Details

* Added list formatting
---
 .../algorithms/sorting-algorithms/insertion-sort/index.md    | 5 ++++-
 1 file changed, 4 insertions(+), 1 deletion(-)

diff --git a/guide/english/algorithms/sorting-algorithms/insertion-sort/index.md b/guide/english/algorithms/sorting-algorithms/insertion-sort/index.md
index 8c567422fb..7eaa444ef3 100644
--- a/guide/english/algorithms/sorting-algorithms/insertion-sort/index.md
+++ b/guide/english/algorithms/sorting-algorithms/insertion-sort/index.md
@@ -170,7 +170,10 @@ void insertionSort(int arr[], int n)
 
 ### Properties:
 * Space Complexity: O(1)
-* Time Complexity: O(n), O(n* n), O(n* n) for Best, Average, Worst cases respectively
+* Time Complexity: O(n), O(n* n), O(n* n) for Best, Average, Worst cases respectively.
+     - Best Case: array is already sorted
+     - Average Case: array is randomly sorted
+     - Worst Case: array is reversely sorted. 
 * Sorting In Place: Yes
 * Stable: Yes