Update sorting/quick_sort.cpp

jiya10208 · realstealthninja · web-flow · commit 576fce6b22c7 · 2024-10-20T10:40:41.000+05:30
Co-authored-by: realstealthninja &lt;68815218+realstealthninja@users.noreply.github.com&gt;
diff --git a/sorting/quick_sort.cpp b/sorting/quick_sort.cpp
@@ -54,7 +54,7 @@ namespace quick_sort {
  * @param high last point of the array (ending index)
  * @returns index of the smaller element
  *  
- *  Time Complexity
+ *  ### Time Complexity
  *  best case, average Case: O(nlog(n))
  *  Worst Case: O(n^2)  (Worst case occur when the partition 
  *  is consistently unbalanced.)

Original file line number	Diff line number	Diff line change
`@@ -54,7 +54,7 @@ namespace quick_sort {`
`54`	`54`	`* @param high last point of the array (ending index)`
`55`	`55`	`* @returns index of the smaller element`
`56`	`56`	`*`
`57`		`- * Time Complexity`
	`57`	`+ * ### Time Complexity`
`58`	`58`	`* best case, average Case: O(nlog(n))`
`59`	`59`	`* Worst Case: O(n^2) (Worst case occur when the partition`
`60`	`60`	`* is consistently unbalanced.)`