<script type="text/javascript">
function Queue(){this.dataStore = [];this.enqueue = enqueue;this.dequeue = dequeue;this.front = front;this.back = back;this.toString = toString;this.empty = empty;this.count = count;
}/**
*    向队尾添加一个元素
*/
function enqueue(element){this.dataStore.push(element);
}/**
*    删除队首的元素：
*/
function dequeue(){this.dataStore.shift();
}/**
*    读取队首的元素：
*/
function front(){return this.dataStore[0];
}/**
*    读取队尾的元素：
*/
function back(){return this.dataStore[this.dataStore.length - 1];
}/**
*    显示队列内的所有元素
*/
function toString(){var retStr = "";for (var i = 0; i < this.dataStore.length; ++i) {retStr += this.dataStore[i] + "\n";}return retStr;
}/**
*    判断队列是否为空
*/
function empty(){if(this.dataStore.length == 0){return true;}else{return false;}
}/**
*    显示队列中有多少个元素
*/
function count(){return this.dataStore.length;
}//===================================使用Queue类=============================================
/**
*    每个舞者信息都被存储在一个Dancer 对象中
*/
function Dancer(name, sex) {this.name = name;this.sex = sex;
}/**
*    将舞者信息从文件中读到程序里来
*    trim() 函数除去了每行字符串后的空格
*    根据性别，将舞者加入不同的队列
*/
function getDancers(males, females){var names = read("dancers.txt").split("\n");for (var i = 0; i < names.length; ++i) {names[i] = names[i].trim();}for (var i = 0; i < names.length; ++i) {var dancer = names[i].split(" ");var sex = dancer[0];var name = dancer[1];if (sex == "F") {females.enqueue(new Dancer(name, sex));}else{males.enqueue(new Dancer(name, sex));}}
}/**
*    将男性和女性组成舞伴，并且宣布配对结果
*/
function dance(males, females){console.log("The dance partners are: \n");while (!females.empty() && !males.empty()) {person = females.dequeue();console.log("Female dancer is: " + person.name);person = males.dequeue();console.log(" and the male dancer is: " + person.name);}
}/**
*测试程序：
*/
var maleDancers = new Queue();
var femaleDancers = new Queue();
getDancers(maleDancers, femaleDancers);
dance(maleDancers, femaleDancers);
if (!femaleDancers.empty()) {print(femaleDancers.front().name + " is waiting to dance.");
}
if (!maleDancers.empty()) {print(maleDancers.front().name + " is waiting to dance.");
}//显示等候跳舞的人数
if (maleDancers.count() > 0) {print("There are " + maleDancers.count() +" male dancers waiting to dance.");
}
if (femaleDancers.count() > 0) {print("There are " + femaleDancers.count() +" female dancers waiting to dance.");
}</script>

<script type="text/javascript">
function Queue(){this.dataStore = [];this.enqueue = enqueue;this.dequeue = dequeue;this.front = front;this.back = back;this.toString = toString;this.empty = empty;this.count = count;
}/**
*    向队尾添加一个元素
*/
function enqueue(element){this.dataStore.push(element);
}/**
*    删除队首的元素：
*/
function dequeue(){return this.dataStore.shift();
}/**
*    读取队首的元素：
*/
function front(){return this.dataStore[0];
}/**
*    读取队尾的元素：
*/
function back(){return this.dataStore[this.dataStore.length - 1];
}/**
*    显示队列内的所有元素
*/
function toString(){var retStr = "";for (var i = 0; i < this.dataStore.length; ++i) {retStr += this.dataStore[i] + "\n";}return retStr;
}/**
*    判断队列是否为空
*/
function empty(){if(this.dataStore.length == 0){return true;}else{return false;}
}/**
*    显示队列中有多少个元素
*/
function count(){return this.dataStore.length;
}//===================================使用Queue类=============================================
/**
*    根据相应位（个位或十位）上的数值,将数字分配到相应队列
*    nums: 待排序的数组
*    queues: 队列数组
*    n: nums的length
*    参数digit 1-按照个位数排序，10-按照十位数排序
*/
function distribute(nums, queues, n, digit){for(var i=0; i<n; i++){if(digit == 1){queues[nums[i]%10].enqueue(nums[i]);}else{var k = Math.floor(nums[i]/10);
            queues[k].enqueue(nums[i]);}}
}/**
*    从队列中收集数字的函数
*/
function collect(queues, nums){var i=0;for(var j=0; j<queues.length; j++){while(!queues[j].empty()){nums[i++] = queues[j].dequeue();}}
}//测试程序
//1.定义queues 和 nums
var queues = [];
for (var i = 0; i < 10; ++i) {queues[i] = new Queue();
}
var nums = [];
for (var i = 0; i < 10; ++i) {nums[i] = Math.floor(Math.random() * 101);
}console.log("Before radix sort: ");
console.log(nums);
distribute(nums, queues, nums.length, 1);            //按照个位数进行第一次排序
collect(queues, nums);                                //对按照个位数排好序的队列，每个队列挨排出列，组成新的数组
distribute(nums, queues, nums.length, 10);            //按照十位数进行第二次排序
collect(queues, nums);
console.log("After radix sort: ");
console.log(nums);</script>

View Code