第五篇 AS的希尔排序

package
{
import flash.display.Sprite;
import flash.display.StageAlign;
import flash.display.StageScaleMode;
import flash.text.TextField;


public class BubbleSort extends Sprite
{
private var txtold:TextField=new TextField();
private var txtnew:TextField=new TextField();
private var oldArr:Array=[];
public function BubbleSort()
{
stage.scaleMode=StageScaleMode.NO_SCALE;
stage.align=StageAlign.TOP_LEFT;

txtold.text="原先的数组是：";
for(var i:int=0;i<10;i++){
oldArr.push(int(Math.random()*100));
txtold.appendText("  ,   "+oldArr[i]);
}
addChild(txtold);
txtold.x=100;
txtold.y=50;
txtold.width=400;
txtold.height=30;

txtnew.text="新的数组是：";
addChild(txtnew);
txtnew.x=100;
txtnew.y=150;
txtnew.width=400;
txtnew.height=30;

//var newArr:Array=bubble();
//var newArr:Array= selectSort();
var newArr:Array= shellSort();
for(var j:int=0;j<newArr.length;j++){
txtnew.appendText("  ,   "+newArr[j]);
}

}

private function shellSort():Array{
var inner:int;
var outer:int;
var temp:int;
var h:int=1;
while(h<=oldArr.length/3){
   h=h*3+1;
}
while(h>0){
   for(outer=h;outer<oldArr.length;outer++){
   temp=oldArr[outer];
inner=outer;
while(inner>(h-1) && oldArr[inner-h]>=temp){
oldArr[inner]=oldArr[inner-h];
inner-=h;
}
oldArr[inner]=temp;
}
h=int((h-1)/3);
}

return oldArr;
}



}

}

其实算不上自己写的，只不过搬过来，都还不深入了解这个算法···