This is a code for QuickSort algorithm

I want to count the number of steps ... or the number of comparisons

I have put a counter .. but it doesn't get the proper result as nlogn or n^2 where n is the input size.

The result does not match, I mean theory VS experiment(code) ... it gets totally different numbers not even close

How can I do it using java ?

int partition (double arr[, int low, int high) int pivot= (int) arr [high]; int i (10-1); // index of smaller element for (int j=low; jStarting index, void quickSort (double arr, int low, int high) if (low