posted 1 year ago
Hi,
I'm currently doing a sorting project where we have to implement random arrays for 10, 100, 1000, 10000, and 100000 elements per sorting algorithm. I've created a method to generate the arrays and I've done some of the sorting methods in order to calculate clock times, array access times, and comparison times. I'm running into a problem with a few of my algorithms. For the one method algorithms like bubble sort and selection sort, I was fine. But when I got into merge sort and quick sort, I see some issues popping up. Can someone please take a look at what I've done wrong?
Generate array
Analysis
mergesort
quicksort with insertion sort
The issue popped up with QuickSort alone as well.
This is how I'm calling it in the main method
Thank you for your help!