Merge pull request #1 from j4zib/master

fixed bubble sort loop

Author: kaidul

algorithms/Bubble_Sort.cpp

@@ -1,5 +1,5 @@
 // O(n^2)
-for(int i = 0; i < n; ++i)
+for(int i = 0; i < n - 1; ++i)
     for(int j = 0, m = n - i - 1; j < m; ++j)
         if(arr[j] > arr[j + 1])
             swap(arr[j], arr[j + 1]);