updated insertion sort

arorarahul · arorarahul · commit 8ff38ed076b2 · 2017-02-20T09:28:53.000+05:30
diff --git a/arrays/question1.c b/arrays/question1.c
@@ -2,10 +2,10 @@
 INSERTION SORT
 Can be remembered as deck of cards taken one by one
 
-Best case:
+Worst case:
 Time complexity (comparisions and movements): O(n^2)
 
-Worst case:
+Best case:
 Time complexity: omega(n)
 
 For both cases:
