Injection Array Sorting Method - C#

injection.cs

static int[] InsertionSort(int[] inputArray)
{
    int[] outputArray = inputArray;
    int tmp;
    bool swapped;
    int count = 0;
    for (int i = 0; i < ARRAY_SIZE - 1; i++)       // checking all numbers
    {
        swapped = false;
        for (int j = i + 1; j > 0; j--)      // initializing the next number
        {
            count++;
            if (inputArray[j - 1] > inputArray[j])    // checking thats the number after the current number IS smaller,
                                                      // so we swap between them, and sort them in the correct order
            {
            tmp = inputArray[j - 1];
            inputArray[j - 1] = inputArray[j];  //swapping if true
            inputArray[j] = tmp;
            swapped = true;
        }
    }
    if (i == ARRAY_SIZE - 1 && !swapped)
    {
        //break;

    }

}
Console.WriteLine(count);

return outputArray;
}