+Bubble Sort is a simple [sorting algorithm](/wiki/Sorting_Algorithm) that repeatedly steps through a list, comparing adjacent elements and swapping them if they are in the wrong order. This causes larger values to "bubble" to the end with each pass. While intuitive, it is generally inefficient for large datasets compared to faster [algorithms](/wiki/Algorithm).
+## See also
+- [Quicksort](/wiki/Quicksort)
+- [Merge Sort](/wiki/Merge_Sort)
+- [Time Complexity](/wiki/Time_Complexity)
... 1 more lines