how to calculate number of camparision in selection sort?

[Mehdinaqvi]

kindly tell me where and how to put comparision condition in order to caculate total number of comparision in selection sort

        static void selectsort(int[] dataset, int n)
        {
            int i, j;
            for (i = 0; i < n; i++)
            {
                int min = i;
                for (j = i + 1; j < n; j++)
                    if (dataset[j] < dataset[min])
                        min = j; //find min value
                //then swap it with the beginning item of the unsorted list
                int temp = dataset[i];
                dataset[i] = dataset[min];
                dataset[min] = temp;
            }

        }



    }
}

[dhayden]

When we talk about comparisons in sorting algorithms, it's comparing one item that's being sorted to another. So in this case, it's line 8.

[anup30]

i am not clear about the question.

in this sorting style total number of comparison = factorial(n-1).

and maximum number of swap = n-1.

in order to find total swaping operation occured add,
int totalSwap = n-1; //line 3
if (min==i) totalSwap--; //line 10

[anup30]

Correction: total number of comparison in selection sort =
(n-1)+(n-2)+(n-3)+......+3+2+1 = n*(n-1)/2