I have implemented both quicksort and mergesort algorithms in Java, but they are not performing efficiently when sorting large datasets of integers (1 to 100,000). The sorting process takes longer than expected, especially as the dataset size increases. I have ensured that my implementations follow standard algorithms, but I’m open to suggestions for improvements or alternative approaches.

I expected the sorting algorithms to handle datasets of up to 100,000 integers efficiently, sorting them in a reasonable amount of time (e.g., under a few seconds).