insertionsort

void insertsort(int array[], int size)
{    
    int sorted = 1;
    
    while (sorted < size - 1)
    {
        for (int i = 0; i <= sorted; i++)
        {
            if (array[i] > array[i + 1])
            {
                int smallest = array[i + 1];
                int temp;
                
                for (int j = i; j >= 0; j--)
                {
                    while (smallest < array[j])
                    {
                        temp = array[j + 1];
                        array[j + 1] = array[j];
                        array[j] = temp;
                    }
                }
            }
        }  
          
        sorted++;
    }
}