scala,python,java插入排序语法实现

python实现：

print("hello world\n")
array=[12,2,3,4,10,1,11,20]
for item in array:
    print(item);
print("end");



for s in range(len(array)):

    for c in range(s+1,len(array),1):

        #交换
        t = array[s]
        if(array[c]<t):
            array[s]=array[c]
            array[c]=t


for n in range(len(array)):
    print(array[n])

-------------------------------------------------

java:

public class InsertSortDemo {

    public static void main(String[] args) {
        Integer[] tt={5,6,8,1,40,2,3,7};
        for(int i=0;i<tt.length;i++){
            //先遍历外层，将最小的放在第一位，再第n次遍历
            for(int j=i+1;j<tt.length;j++){
                int t=tt[i];
                //交换
                if(tt[j]<t){
                    tt[i]=tt[j];
                    tt[j]=t;
                }
            }
        }

        for(int i=0;i<tt.length;i++){
            System.out.println(tt[i]);
        }
    }
}

--------------------------------------------

scala:

object TestObject {
  def main(args: Array[String]): Unit = {
    System.out.print("hello world")
    var array=Array(2,3,4,5,6,10,7,8,9);
    for(x <- array){
      println(x)
    }
    for(i <- 0 to array.length-1 ){
      //遍历
      for(n <-i+1 to array.length-1){
        //交换
        var tmp=array(i);
        if(array(n)<tmp){
          array(i)=array(n);
          array(n)=tmp;
        }
      }
    }
    for(i <- array){
      println(i)
    }
  }
}