diff --git a/src/algorithms/sorting/bubble-sort/README.md b/src/algorithms/sorting/bubble-sort/README.md
index 7bf82b8a..ca784fad 100644
--- a/src/algorithms/sorting/bubble-sort/README.md
+++ b/src/algorithms/sorting/bubble-sort/README.md
@@ -3,9 +3,10 @@
 Bubble sort, sometimes referred to as sinking sort, is a 
 simple sorting algorithm that repeatedly steps through 
 the list to be sorted, compares each pair of adjacent 
-items and swaps them if they are in the wrong order(ascending or descending arrangement). 
-The pass through the list is repeated until no swaps 
-are needed, which indicates that the list is sorted.
+items and swaps them if they are in the wrong order 
+(ascending or descending arrangement). The pass through
+the list is repeated until no swaps are needed, which 
+indicates that the list is sorted.
 
 ![Algorithm Visualization](https://upload.wikimedia.org/wikipedia/commons/c/c8/Bubble-sort-example-300px.gif)