I am trying to implement an algorithm using different data structure implementations to see their difference, and noticed that for the exact same algorithm using a different data structure, the "Self Time" in the algorithm method is very high.
Is there a way in VisualVM to investigate why Self Time is high in a method, given that the algorithm is implemented exactly the same way with just a different data structure? (To make it even more perplexing, the method with high Self Time has much lower CPU time to use its data structure. I don't know why time in the algorithm itself is so much higher.)