Shell sort's key concept is that it compares distant elements first.
Shellsort works by defining a gap sequence that indicates how far apart compared elements are when starting the sorting process.
The gap sequence can be defined dynamically.
function MyArray(numElements) { //w w w .ja v a2s .com
this.dataStore = [];
this.pos = 0;
this.numElements = numElements;
this.insert = insert;
this.toString = toString;
this.clear = clear;
this.setData = setData;
this.swap = swap;
this.shellsort = shellsort;
this.gaps = [5,3,1];
this.setGaps = setGaps;
for (var i = 0; i < numElements; ++i) {
this.dataStore[i] = i;
}
}
function setGaps(arr) {
this.gaps = arr;
}
function setData() {
for (var i = 0; i < this.numElements; ++i) {
this.dataStore[i] = Math.floor(Math.random() * (this.numElements+1));
}
}
function clear() {
for (var i = 0; i < this.dataStore.length; ++i) {
this.dataStore[i] = 0;
}
}
function insert(element) {
this.dataStore[this.pos++] = element;
}
function toString() {
var retstr = "";
for (var i = 0; i < this.dataStore.length; ++i) {
retstr += this.dataStore[i] + " ";
if (i > 0 && i % 10 == 0) {
retstr += "\n";
}
}
return retstr;
}
function swap(arr, index1, index2) {
var temp = arr[index1];
arr[index1] = arr[index2];
arr[index2] = temp;
}
function shellsort() {
for (var g = 0; g < this.gaps.length; ++g) {
for (var i= this.gaps[g]; i < this.dataStore.length; ++i) {
var temp = this.dataStore[i];
for (var j = i; j >= this.gaps[g] && this.dataStore[j-this.gaps[g]] > temp; j -= this.gaps[g]) {
this.dataStore[j] = this.dataStore[j -this.gaps[g]];
}
this.dataStore[j] = temp;
}
}
}
var numElements = 10;
var mynums = new MyArray(numElements);
mynums.setData();
console.log(mynums.toString());
mynums.shellsort();
console.log();
console.log(mynums.toString());
The code above generates the following result.