I need a JAVA coder for heap sort.

I created 3 data
ordered (1,2,3,4,5,6,7,8,9,10)
reverse (10,9,8,7,6,5,4,3,2,1)
random (2,4,5,7,3,9,1,6,8,10)

I need to implement heap sort and use these data to find the number of comparisons and exchanges for best-case, worst-case, average-case.