Restructure folders.

README.md

@@ -30,13 +30,14 @@
 * **Math**
   * [Factorial](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/math/factorial)
   * [Fibonacci Number](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/math/fibonacci)
-  * [Cartesian Product](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/math/cartesian-product) - product of multiple sets
-  * [Power Set](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/math/power-set) - all subsets of the set
-  * [Permutations](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/math/permutations) (with and without repetitions)
-  * [Combinations](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/math/combinations) (with and without repetitions)  
   * [Primality Test](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/math/primality-test) (trial division method)
   * [Euclidean Algorithm](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/math/euclidean-algorithm) - calculate the Greatest Common Divisor (GCD)
   * [Least Common Multiple](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/math/least-common-multiple) (LCM)
+* **Sets**
+  * [Cartesian Product](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/cartesian-product) - product of multiple sets
+  * [Power Set](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/power-set) - all subsets of the set 
+  * [Permutations](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/permutations) (with and without repetitions)
+  * [Combinations](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/sets/combinations) (with and without repetitions)
   * [Fisher–Yates Shuffle](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/math/fisher-yates) - random permutation of a finite sequence 
 * **String**
   * [Levenshtein Distance](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/string/levenshtein-distance) - minimum edit distance between two sequences

src/algorithms/sets/combinations/__test__/combineWithRepetitions.test.js

@@ -1,5 +1,5 @@
 import combineWithRepetitions from '../combineWithRepetitions';
-import factorial from '../../factorial/factorial';
+import factorial from '../../../math/factorial/factorial';
 
 describe('combineWithRepetitions', () => {
   it('should combine string with repetitions', () => {

src/algorithms/sets/combinations/__test__/combineWithoutRepetitions.test.js

@@ -1,5 +1,5 @@
 import combineWithoutRepetitions from '../combineWithoutRepetitions';
-import factorial from '../../factorial/factorial';
+import factorial from '../../../math/factorial/factorial';
 
 describe('combineWithoutRepetitions', () => {
   it('should combine string without repetitions', () => {

src/algorithms/sets/permutations/__test__/permutateWithoutRepetitions.test.js

@@ -1,5 +1,5 @@
 import permutateWithoutRepetitions from '../permutateWithoutRepetitions';
-import factorial from '../../factorial/factorial';
+import factorial from '../../../math/factorial/factorial';
 
 describe('permutateWithoutRepetitions', () => {
   it('should permutate string', () => {