Added in all the test cases and fixed the visiting count since it sta…

…tes 'each time the sorting function is visiting the next element.'

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

@@ -9,10 +9,11 @@ export default class OddEvenSort extends Sort {
     // Go through all array elements...
     while (!sorted) {
       sorted = true;
+
       // Sort all the odd indexes
       for (let i = 1; i < array.length - 1; i += 2) {
         // Call visiting callback.
-        this.callbacks.visitingCallback(array[i]);
+        this.callbacks.visitingCallback(array[i + 1]);
 
         // Swap elements if they are in wrong order.
         if (this.comparator.lessThan(array[i + 1], array[i])) {
@@ -25,7 +26,7 @@ export default class OddEvenSort extends Sort {
       // Sort all the even indexes
       for (let i = 0; i < array.length - 1; i += 2) {
         // Call visiting callback.
-        this.callbacks.visitingCallback(array[i]);
+        this.callbacks.visitingCallback(array[i + 1]);
 
         // Swap elements if they are in wrong order.
         if (this.comparator.lessThan(array[i + 1], array[i])) {

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

@@ -1,17 +1,17 @@
 import OddEvenSort from '../OddEvenSort';
 import {
-  // equalArr,
-  // notSortedArr,
+  equalArr,
+  notSortedArr,
   reverseArr,
-  // sortedArr,
+  sortedArr,
   SortTester,
 } from '../../SortTester';
 
 // Complexity constants.
-// const SORTED_ARRAY_VISITING_COUNT = 20;
-// const NOT_SORTED_ARRAY_VISITING_COUNT = 189;
+const EQUAL_ARRAY_VISITING_COUNT = 19;
+const SORTED_ARRAY_VISITING_COUNT = 19;
+const NOT_SORTED_ARRAY_VISITING_COUNT = 171;
 const REVERSE_SORTED_ARRAY_VISITING_COUNT = 209;
-// const EQUAL_ARRAY_VISITING_COUNT = 20;
 
 describe('OddEvenSort', () => {
   it('should sort array', () => {
@@ -30,29 +30,29 @@ describe('OddEvenSort', () => {
     SortTester.testNegativeNumbersSort(OddEvenSort);
   });
 
-  // it('should visit EQUAL array element specified number of times', () => {
-  //   SortTester.testAlgorithmTimeComplexity(
-  //     OddEvenSort,
-  //     equalArr,
-  //     EQUAL_ARRAY_VISITING_COUNT,
-  //   );
-  // });
+  it('should visit EQUAL array element specified number of times', () => {
+    SortTester.testAlgorithmTimeComplexity(
+      OddEvenSort,
+      equalArr,
+      EQUAL_ARRAY_VISITING_COUNT,
+    );
+  });
 
-  // it('should visit SORTED array element specified number of times', () => {
-  //   SortTester.testAlgorithmTimeComplexity(
-  //     OddEvenSort,
-  //     sortedArr,
-  //     SORTED_ARRAY_VISITING_COUNT,
-  //   );
-  // });
+  it('should visit SORTED array element specified number of times', () => {
+    SortTester.testAlgorithmTimeComplexity(
+      OddEvenSort,
+      sortedArr,
+      SORTED_ARRAY_VISITING_COUNT,
+    );
+  });
 
-  // it('should visit NOT SORTED array element specified number of times', () => {
-  //   SortTester.testAlgorithmTimeComplexity(
-  //     OddEvenSort,
-  //     notSortedArr,
-  //     NOT_SORTED_ARRAY_VISITING_COUNT,
-  //   );
-  // });
+  it('should visit NOT SORTED array element specified number of times', () => {
+    SortTester.testAlgorithmTimeComplexity(
+      OddEvenSort,
+      notSortedArr,
+      NOT_SORTED_ARRAY_VISITING_COUNT,
+    );
+  });
 
   it('should visit REVERSE SORTED array element specified number of times', () => {
     SortTester.testAlgorithmTimeComplexity(