diff --git a/Array/InsertionSort.cpp b/Array/InsertionSort.cpp
index 991a60f..6fe8b3b 100644
--- a/Array/InsertionSort.cpp
+++ b/Array/InsertionSort.cpp
@@ -1,14 +1,17 @@
 //Insertion sort
 void insertionSort(int a[], int n)
 {
+    //Nested looping is required 
+    //while loop inside for loop
     int key, i, j;
-    for(i = 1 ; i < n ; i++)
+    for(i = 1 ; i < n ; i++) 
     {
         key = a[i];
         j = i - 1;
         
         while(j >= 0 && a[j] > key)
         {
+            //here insertion is taking place
             a[j + 1] = a[j];
             j--;
         }
diff --git a/Array/MaxSumSubArraySizek.cpp b/Array/MaxSumSubArraySizek.cpp
index ffa635c..f008cff 100644
--- a/Array/MaxSumSubArraySizek.cpp
+++ b/Array/MaxSumSubArraySizek.cpp
@@ -1,3 +1,4 @@
+   #include <bits/stdc++.h> // It includes all necessary header files
     // Max sum subarray of size k
     // Time : O(n)
     //Space : O(1)