<h3>功能:数字数组大小排序</h3>
<script language="javascript">
var array = [54, 23, 38, 4, 234, 9, 11];
document.write("原数组为:[" + array.toString() + "]" + "<br />");
// 求最大值:
var max = Number.NEGATIVE_INFINITY;
document.write("负无穷:" + max + "; 类型为:" + typeof max + "; <br />");
for(var i=0, len=array.length; i<len; i++) {
if(array[i] > max) {
max = array[i];
}
}
document.write("数组中最大的数值为:" + max + "; <br /><br /><br />");
// 排序:
function sortFn(inArray) {
var newArray = [],
index,
m;
document.write("原始数组为:" + inArray + "<br />");
do{
m = Number.NEGATIVE_INFINITY;
for(var i=0, len=inArray.length; i<len; i++) {
if(inArray[i] > m) {
m = inArray[i];
}
}
document.write("->" + m + "<br />");
newArray.push(m);
document.write("newArray数组为:" + newArray.toString() + "<br />");
index = inArray.indexOf(m);
inArray.splice(index, 1);
document.write("inArray数组为:" + inArray.toString() + "<br /><br />");
} while(inArray.length !=0);
return newArray.toString();
}
var result = sortFn(array).split(",");
document.write("从大到小排序为:" + result + "<br />");
document.write("从小到大排序为:" + result.reverse() + "<br /><br />");
// 冒泡排序:
var secArray = [45, 23, 99, 11, 233, 87];
document.write("冒泡比较法:原始数组_"+ secArray + "<br />");
var len = secArray.length,
empty;
for(var k=0; k<len-1; k++) {
for(var i=0; i<len-k-1; i++) {
if(secArray[i]>secArray[i+1]) {
empty = secArray[i+1];
secArray[i+1] = secArray[i];
secArray[i] = empty
}
}
}
document.write("冒泡比较法为:结果为(默认为小到大)_"+ secArray + "<br />");
</script>