Added complexity info for Insertion Sort.

Author: polcats

index.html

@@ -121,6 +121,18 @@ <h2 class="algo-header">Insertion Sort</h2>
                     Insertion Sort is a simple sorting algorithm that builds the final sorted array one item at a time. It is much less efficient on
                     large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.
                 </span>
+                <span class="algo-complexity">
+                    <ul>
+                        <li class="algo-info"><span class="complexity-item">Worst Complexity : </span><span class="complexity-value">N ^ 2</span></li>
+                        <li class="algo-info">
+                            <span class="complexity-item">Average Complexity : </span><span class="complexity-value">N ^ 2</span>
+                        </li>
+                        <li class="algo-info"><span class="complexity-item">Best Complexity : </span><span class="complexity-value">N</span></li>
+                        <li class="algo-info"><span class="complexity-item">Space Complexity : </span><span class="complexity-value">1</span></li>
+                        <li class="algo-info"><span class="complexity-item">Method : </span><span class="complexity-value">Insertion</span></li>
+                        <li class="algo-info"><span class="complexity-item">Stable : </span><span class="complexity-value">Yes</span></li>
+                    </ul>
+                </span>
             </div>
 
             <div id="selection-info" class="algo-container hidden">