Added complexity info for Comb Sort.

Author: polcats

index.html

@@ -77,6 +77,18 @@ <h2 class="algo-header">Comb Sort</h2>
                     Comb Sort is mainly an improvement over Bubble Sort. Bubble sort always compares adjacent values. So all inversions are removed
                     one by one. Comb Sort improves on Bubble Sort by using gap of size more than 1.
                 </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 * log(N)</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">Exchanging</span></li>
+                        <li class="algo-info"><span class="complexity-item">Stable : </span><span class="complexity-value">No</span></li>
+                    </ul>
+                </span>
             </div>
 
             <div id="heap-info" class="algo-container hidden">