diff --git a/Sorts/OddEvenSort.js b/Sorts/OddEvenSort.js
new file mode 100644
index 000000000..ade4c7360
--- /dev/null
+++ b/Sorts/OddEvenSort.js
@@ -0,0 +1,40 @@
+/*
+  odd–even sort or odd–even transposition sort
+  is a relatively simple sorting algorithm, developed originally for use on parallel processors with local interconnections.
+  It is a comparison sort related to bubble sort, with which it shares many characteristics.
+
+   for more information : https://en.wikipedia.org/wiki/Odd%E2%80%93even_sort
+*/
+
+// Helper function to swap array items
+function swap (arr, i, j) {
+  const tmp = arr[i]
+  arr[i] = arr[j]
+  arr[j] = tmp
+}
+
+function oddEvenSort (arr) {
+  let sorted = false
+  while (!sorted) {
+    sorted = true
+    for (let i = 1; i < arr.length - 1; i += 2) {
+      if (arr[i] > arr[i + 1]) {
+        swap(arr, i, i + 1)
+        sorted = false
+      }
+    }
+    for (let i = 0; i < arr.length - 1; i += 2) {
+      if (arr[i] > arr[i + 1]) {
+        swap(arr, i, i + 1)
+        sorted = false
+      }
+    }
+  }
+}
+const testArray = [5, 6, 7, 8, 1, 2, 12, 14, 5, 3, 2, 2]
+
+// Array before sort
+console.log(testArray)
+oddEvenSort(testArray)
+// Array after sort
+console.log(testArray)