java - Count the number of comparisons and the number of copies each sorting algorithm performs

Question

In Java, how do I take Bubble Sort, Insertion Sort, Merge Sort, Shell Sort, and Quick Sort and make a counter to tell me how many times they preform a comparison or copy.

I have all of the sorters made I just don't know how to make a counter.

Any ideas?

Answer 1

It's rather simple, unless I am much mistaken.

For X Sort:

private int copyCounter = 0;
private int comparisonCounter = 0;

public void XSort(){

     // Sorting logic start
     ....
     //Perform comparison operation
     comparisonCounter++;
     ....
     //Perform copy operation
     copyCounter++;
     ....
     //Sorting logic ends

     //Print the values of copyCounter here
}

Once your method completes execution you will have the required counts. Assuming you have all the sorts implemented as separate classes you will need to modify your sort method in individual classes as above.