first commit for odd even sorting

src/algorithms/sorting/odd-even-sort/OddEvenSort.js

@@ -0,0 +1,37 @@
+import Sort from '../Sort';
+
+export default class OddEvenSort extends Sort {
+  swap(array, i, j){
+    var temp = array[i];
+    array[i] = array[j];
+    array[j] = temp;
+  }
+
+  sort(originalArray) {
+    // Clone original array to prevent its modification.
+    const array = [...originalArray];
+    const sorted = false;
+
+    // Go through all array elements...
+    while (!sorted) {
+      sorted = true;
+      for(let i = 1; i < array.length; i+2){
+        // Call visiting callback.
+        this.callbacks.visitingCallback(array[i]);
+        if(array[i] > array[i+1]){
+          swap(array, i, i+1);
+          sorted = false;
+        }
+      }
+      for(let i = 0; i < array.length - 1; i+2){
+        // Call visiting callback.
+        this.callbacks.visitingCallback(array[i]);
+        if(array[i] > array[i+1]){
+          swap(array, i, i+1);
+          sorted = false;
+        }
+      }
+    }
+    return array;
+  }
+}

src/algorithms/sorting/odd-even-sort/README.md

@@ -0,0 +1,16 @@
+# Odd-Even Sort
+
+Odd-Even sort
+
+![Algorithm Visualization](https://upload.wikimedia.org/wikipedia/commons/1/1b/Odd_even_sort_animation.gif)
+
+## Complexity
+
+| Name                    | Best            | Average             | Worst               | Memory    | Stable    | Comments                                  |
+| ----------------------- | :-------------: | :-----------------: | :-----------------: | :-------: | :-------: | :---------------------------------------- |
+| **Odd-Even sort**       | n               | n<sup>2</sup>       | n<sup>2</sup>       | 1         | Yes       | Can be run on parallel processors easily. |
+
+## References
+
+- [Wikipedia](https://en.wikipedia.org/wiki/Odd–even_sort)
+<!-- - [YouTube](https://www.youtube.com/watch?v=6Gv8vg0kcHc&index=27&t=0s&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8) -->