Added complexity info for Heap Sort.

Author: polcats

index.html

@@ -97,6 +97,22 @@ <h2 class="algo-header">Heap Sort</h2>
                     Heap sort is a comparison based sorting technique based on Binary Heap data structure. It is similar to selection sort where we
                     first find the maximum element and place the maximum element at the end. We repeat the same process for remaining element.
                 </span>
+                <span class="algo-complexity">
+                    <ul>
+                        <li class="algo-info">
+                            <span class="complexity-item">Worst Complexity : </span><span class="complexity-value">N * log(N)</span>
+                        </li>
+                        <li class="algo-info">
+                            <span class="complexity-item">Average Complexity : </span><span class="complexity-value">N * log(N)</span>
+                        </li>
+                        <li class="algo-info">
+                            <span class="complexity-item">Best Complexity : </span><span class="complexity-value">N * log(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">Selection</span></li>
+                        <li class="algo-info"><span class="complexity-item">Stable : </span><span class="complexity-value">No</span></li>
+                    </ul>
+                </span>
             </div>
 
             <div id="insertion-info" class="algo-container hidden">