From 5d329b56b261f2e6883b4353a82558d523565f26 Mon Sep 17 00:00:00 2001
From: Hui Chen <johnhuichen@MacBook-Pro.local>
Date: Sat, 28 May 2016 00:57:08 -0600
Subject: [PATCH] Added cycle sort

---
 algorithm/category.json               |  3 +-
 algorithm/sorting/cycle/basic/code.js | 57 +++++++++++++++++++++++++++
 algorithm/sorting/cycle/basic/data.js |  4 ++
 algorithm/sorting/cycle/desc.json     | 13 ++++++
 4 files changed, 76 insertions(+), 1 deletion(-)
 create mode 100644 algorithm/sorting/cycle/basic/code.js
 create mode 100644 algorithm/sorting/cycle/basic/data.js
 create mode 100644 algorithm/sorting/cycle/desc.json

diff --git a/algorithm/category.json b/algorithm/category.json
index 40bac64f..81c711fa 100644
--- a/algorithm/category.json
+++ b/algorithm/category.json
@@ -41,7 +41,8 @@
       "radix": "Radix Sort",
       "quick": "Quicksort",
       "heap" : "Heapsort",
-      "shell": "Shellsort"
+      "shell": "Shellsort",
+      "cycle": "Cycle Sort"
     }
   },
   "string": {
diff --git a/algorithm/sorting/cycle/basic/code.js b/algorithm/sorting/cycle/basic/code.js
new file mode 100644
index 00000000..e8fbfc98
--- /dev/null
+++ b/algorithm/sorting/cycle/basic/code.js
@@ -0,0 +1,57 @@
+logger._print( 'original array = [' + D.join(', ') + ']' );
+var N = D.length;
+var writes = 0;
+var pos;
+var item;
+var temp;
+for( cycleStart=0; cycleStart<=N-2; cycleStart++ ){
+    item = D[cycleStart];
+    pos = cycleStart;
+    for( i=cycleStart+1; i<=N-1; i++ ){
+        if( D[i]<item ){
+            pos++;
+        }
+    }
+    if( pos == cycleStart ){
+        continue;
+    }
+    while( item == D[pos] ){
+        pos++;
+    }
+    temp = D[pos];
+    D[pos] = item;
+    item = temp;
+
+    logger._print( 'Rewrite '+D[pos]+' to index '+pos );
+
+    tracer._notify(pos, D[pos])._notify(cycleStart, D[cycleStart])._wait();
+    tracer._denotify(pos)._denotify(pos);
+
+
+    while( pos != cycleStart ){
+        pos = cycleStart;
+        for( i=cycleStart+1; i<=N-1; i++ ){
+            if( D[i]<item ){
+                pos++;
+            }
+        }
+
+        while( item == D[pos] ){
+            pos++;
+        }
+        temp = D[pos];
+        D[pos] = item;
+        item = temp;
+
+        logger._print( 'Rewrite '+D[pos]+' to index '+pos );
+
+        tracer._notify(pos, D[pos])._notify(cycleStart, D[cycleStart])._wait();
+        tracer._denotify(pos)._denotify(pos);
+
+        writes++;
+    }
+
+    writes++;
+}
+
+logger._print( 'Number of writes performed is ' + writes );
\ No newline at end of file
diff --git a/algorithm/sorting/cycle/basic/data.js b/algorithm/sorting/cycle/basic/data.js
new file mode 100644
index 00000000..13f71a0b
--- /dev/null
+++ b/algorithm/sorting/cycle/basic/data.js
@@ -0,0 +1,4 @@
+var tracer = new Array1DTracer();
+var logger = new LogTracer();
+var D = Array1D.random(15);
+tracer._setData(D);
\ No newline at end of file
diff --git a/algorithm/sorting/cycle/desc.json b/algorithm/sorting/cycle/desc.json
new file mode 100644
index 00000000..50c2a7fc
--- /dev/null
+++ b/algorithm/sorting/cycle/desc.json
@@ -0,0 +1,13 @@
+{
+  "Cycle Sort": "Cycle sort is an in-place, unstable sorting algorithm, a comparison sort that is theoretically optimal in terms of the total number of writes to the original array, unlike any other in-place sorting algorithm. It is based on the idea that the permutation to be sorted can be factored into cycles, which can individually be rotated to give a sorted result.",
+  "Complexity": {
+    "time": "worst O(n<sup>2</sup>), best O(n<sup>2</sup>), average O(n<sup>2</sup>)",
+    "space": "worst O(1) auxiliary"
+  },
+  "References": [
+    "<a href='https://en.wikipedia.org/wiki/Cycle_sort'>Wikipedia</a>"
+  ],
+  "files": {
+    "basic": "Cycle Sort"
+  }
+}
\ No newline at end of file