常见排序算法概述

    void insertionSort(int arr[], int len)
    {
    int insertPosi;
    
    for (int i = 0; i < len; i++)
    {
        insertPosi = 0;                     //can't find the bigger position then keep the insertPosi 0
        //find the insert position
        for (int j = i - 1; j >= 0; j--)
        {
            if (arr[j] <= arr[i])
            {
                insertPosi = j + 1;         //insert at arr[j + 1], minimum of inserPosi is 1 int the loop;
                break;
            }
        }
    
    
        //same position