添加奇偶排序

meda-tools · meda-tools · commit e78253234251 · 2016-01-25T13:46:04.000+08:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@
     -   希尔排序
 -   交换排序
     -   冒泡泡排序
+    -   奇偶排序
     -   快速排序
 -   选择排序
     -   直接选择排序
diff --git a/src/org/algorithm/array/sort/client/SortClient.java b/src/org/algorithm/array/sort/client/SortClient.java
@@ -1,15 +1,15 @@
 package org.algorithm.array.sort.client;
 
-import org.algorithm.array.sort.impl.ShellSort;
+import org.algorithm.array.sort.impl.OddEvenSort;
 import org.algorithm.array.sort.interf.Sortable;
 import org.utils.naga.containers.ArrayUtils;
 
 public class SortClient {
 
     public static void main(String[] args) {
         int[] array = {34, 23, 76, 56, 54, 12, 34, 65, 45, 9, 8, 7, 6, 5};
-//        int[] array = {13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
-        Sortable sortable = new ShellSort();
+//        int[] array = {6, 5, 4, 3, 2, 1};
+        Sortable sortable = new OddEvenSort();
         array = sortable.sort(array);
         
         ArrayUtils.show(array);
diff --git a/src/org/algorithm/array/sort/impl/OddEvenSort.java b/src/org/algorithm/array/sort/impl/OddEvenSort.java
@@ -1,6 +1,7 @@
 package org.algorithm.array.sort.impl;
 
 import org.algorithm.array.sort.interf.Sortable;
+import org.utils.naga.containers.ArrayUtils;
 
 /**
  * <p>
@@ -19,8 +20,39 @@ public class OddEvenSort implements Sortable {
 
     @Override
     public int[] sort(int[] array) {
-        // TODO Auto-generated method stub
-        return null;
+        if (array == null) {
+            return null;
+        }
+
+        core(array);
+        
+        return array;
     }
 
+    private void core(int[] array) {
+        int arrayLength = array.length;
+        boolean oddSorted = false;
+        boolean evenSorted = false;
+        
+        while(!oddSorted || !evenSorted) {
+            int base = 0;
+            oddSorted = true;
+            evenSorted = true;
+            
+            for (int i = base; i < arrayLength - 1; i += 2) {
+                if (array[i] > array[i + 1]) {
+                    ArrayUtils.swap(array, i, i + 1);
+                    oddSorted = false;
+                }
+            }
+            
+            base = 1;
+            for (int i = base; i < arrayLength - 1; i += 2) {
+                if (array[i] > array[i + 1]) {
+                    ArrayUtils.swap(array, i, i + 1);
+                    evenSorted = false;
+                }
+            }
+        }
+    }
 }
