typo

divide_and_conquer/heaps_algorithm.py

@@ -1,6 +1,6 @@
 """
 Heap's algorithm returns the list of all permutations possible from a list.
-It minimizes movement by generating each permutation from the previous
+It minimizes movement by generating each permutation from the previous one
 by swapping only two elements.
 More information:
 https://en.wikipedia.org/wiki/Heap%27s_algorithm.