Update sorting/bubble_sort.cpp

hollowcrust · realstealthninja · web-flow · commit 010ff9391e28 · 2024-10-09T22:31:12.000+08:00
Co-authored-by: realstealthninja &lt;68815218+realstealthninja@users.noreply.github.com&gt;
diff --git a/sorting/bubble_sort.cpp b/sorting/bubble_sort.cpp
@@ -26,7 +26,7 @@
  * That's why we created a variable z to create the first value of the value of x,
  * and finally, we have assigned to y.
  * 
- * Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)
+ * ## Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)
  * 
  * Bubble Sort Worst Case Performance is \f$O(n^{2})\f$. Why is that? Because if you
  * remember Big O Notation, we were calculating the complexity of the algorithms in

Original file line number	Diff line number	Diff line change
`@@ -26,7 +26,7 @@`
`26`	`26`	`* That's why we created a variable z to create the first value of the value of x,`
`27`	`27`	`* and finally, we have assigned to y.`
`28`	`28`	`*`
`29`		`- * Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)`
	`29`	`+ * ## Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)`
`30`	`30`	`*`
`31`	`31`	`* Bubble Sort Worst Case Performance is \f$O(n^{2})\f$. Why is that? Because if you`
`32`	`32`	`* remember Big O Notation, we were calculating the complexity of the algorithms in`