算法001.插入排序

#include <iostream>;

using namespace std;
void insertion_sort(int * arr, int length);

int main()
{
    int arr[] = {2,45,5,8,10,4,9,45,8,36,159,125,134,147,155};
    int length = sizeof(arr)/sizeof(int);
    insertion_sort(arr, length);
    for (int i = 0; i< length; i++)
    {
        cout << arr[i] << endl;
    }
    cin.get();

}

void insertion_sort(int * arr, int length)
{
    int i, j;
    for(i = 1; i < length; i++)
    {
        int temp = arr[i];
        j = i - 1;
        while (j >= 0 && arr[j] > temp)
        {
            arr[j+1] = arr[j];
            j--;
        }
        arr[j+1] = temp;
        
    }
}

记录下学习算法的过程，原理相信看算法导论会更清楚，文字表达能力太差，也就不说了，附上js的，和c++一样，当作自己的复习

var arr = [2, 45, 5, 8, 10, 4, 9, 45, 8, 36, 159, 125, 134, 147, 155];
arr = insertionSort(arr);
console.log(arr);
function insertionSort(arr) {
    var i, j, temp;
    for (i = 1; i < arr.length; i++) {
        temp = arr[i];
        j = i - 1;
        while (j >= 0 && arr[j] > temp) {
            arr[j + 1] = arr[j];
            j--;
        }
        arr[j+1] = temp
    }
    return arr;
}