Bubble sort added as an example (#22141)

I added bubble sort as it is one of the most used sorting algorithms and as it is one of the easiest ones for beginners.

guide/english/algorithms/index.md

@@ -47,9 +47,13 @@ There is no sorting discussion which can finish without quick sort.
 It is the sorting algorithm which relies on the concept how to sorted arrays are merged to give one sorted arrays. Read more about it here-
 [Merge Sort](https://www.geeksforgeeks.org/merge-sort/)
 
+
+#### Bubble Sort
+One of the simplest sorting algorithms there is and one of the easiest to implement. It relies on the comparison of two adjacent numbers in an array and swapping them if one is bigger than the other. Read more about it here - [Bubble Sort](https://www.geeksforgeeks.org/bubble-sort/).
+
 #### Heap Sort
-A sorting algorithm that works by first organizing the data to be sorted into a special type of binary tree called a heap. The heap itself has, by definition, the largest value at the top of the tree, so the heap sort algorithm must also reverse the order. Read more about it here-
-[Heap Sort](https://www.geeksforgeeks.org/heap-sort/)
+A sorting algorithm that works by first organizing the data to be sorted into a special type of binary tree called a heap. The heap itself has, by definition, the largest value at the top of the tree, so the heap sort algorithm must also reverse the order. Read more about it here - [Heap Sort](https://www.geeksforgeeks.org/heap-sort/).
+
 
 freeCodeCamp's curriculum heavily emphasizes creating algorithms. This is because learning algorithms is a good way to practice programming skills. Interviewers most commonly test candidates on algorithms during developer job interviews.