Skip to content

Added comment for cycle sort #130

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
nem035 merged 2 commits into from
Jun 1, 2016
Merged

Added comment for cycle sort #130

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
8ff1039
Merge pull request #1 from parkjs814/gh-pages
johnhuichen Jun 1, 2016
4e00b4e
added comments in code.js
Jun 1, 2016
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
20 changes: 14 additions & 6 deletions algorithm/sorting/cycle/basic/code.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,11 +1,13 @@
logger._print('original array = [' + D.join(', ') + ']');
var N = D.length;
var writes = 0;
var pos;
var item;
var temp;
var writes = 0; // number of writing performed
var pos; // the index of item in the sorted array
var item; // an item in the array
var temp; // a temp value used for storing swapped item
for (var cycleStart = 0; cycleStart <= N - 2; cycleStart++) {
item = D[cycleStart];

// find where to put the item
pos = cycleStart;
tracer._select(cycleStart);

Expand All @@ -15,18 +17,25 @@ for (var cycleStart = 0; cycleStart <= N - 2; cycleStart++) {
pos++;
}
}

// if the item is already there, this is not a circle
if (pos == cycleStart) {
tracer._deselect(cycleStart);
continue;
}

// otherwise put the item there or right after any duplicates
while (item == D[pos]) {
pos++;
}

// write item to new index and increment writes
temp = D[pos];
D[pos] = item;
item = temp;

writes++;

if (pos !== cycleStart) {
logger._print('Rewrite ' + D[pos] + ' to index ' + pos + '; the next value to rewrite is ' + item);
} else {
Expand All @@ -36,6 +45,7 @@ for (var cycleStart = 0; cycleStart <= N - 2; cycleStart++) {
tracer._notify(pos, D[pos])._notify(cycleStart, D[cycleStart])._wait();
tracer._denotify(pos)._denotify(cycleStart);

// rotate the rest of the cycle
while (pos != cycleStart) {
pos = cycleStart;

Expand Down Expand Up @@ -65,8 +75,6 @@ for (var cycleStart = 0; cycleStart <= N - 2; cycleStart++) {

writes++;
}

writes++;
}

logger._print('Number of writes performed is ' + writes);