算法-插入排序实现

insertion-sort.js

function insertionSort(arr){
	var len = arr.length,index = 0,val
	for(var j = 1;j < len ; j++){
		val = arr[j]
		index = j - 1;
		while(index >= 0 && val < arr[index]){
			arr[index+1] = arr[index]
			index = index - 1
		}
		arr[index+1] = val		
	}
	return arr
}

insertion-sort.php

<?php
function insertionSort($arr){
	$len = count($arr);
	for($j = 1;$j < $len ; $j++){
		$val = $arr[$j];
		$index = $j - 1;
		for($index = $j - 1; $index >= 0; $index--){
			if($val > $arr[$index]){
				break;	
			}
			$arr[$index+1] = $arr[$index];
		}
		$arr[$index+1] = $val;		
	}
	return $arr;
}

insertion-sort.py

def insertionSort(arr):
    for index in range(1,len(arr)):
        val = arr[index]
        prev = index - 1
        while prev >= 0 and arr[prev] > val:
            arr[prev + 1] = arr[prev]
            prev = prev - 1
        arr[prev + 1] = val

    return arr