Hello, as it can be inferred from profile, I am new. I have read the community guidelines and I have done prior research.

I am a very weak coder(through my own fault). However, I like to believe I firm conceptual understanding.

**So What is my problem?** I have an assignement that requires analysis of three fast sorting algorithms(radix, quick sort, and merge sort). The exact specifications are as follows:

Design and implement a variation of QuickSorter class that partitions the

sequence to be sorted using the pivot other than the first element in the

sequence.

Run a sequence of experiments to compare the running times of your sorter

with your new pivot selection.Design and implement Radix sorter of an array by using and Queue ADT for

each group.

Run a sequence of experiments to compare the running times.Design and implement Merge sorter of an array by using recursion.

Run a sequence of experiments to compare the running*

I understand how the three algorithms work. However, I still need guidence on how I will go about creating a program that will implement all three and compare the running times.

**Specific questions**

1)How will I go about timing my algorithms?

2)What will be the most effective way to implement the algorithms?(will I create 3 sorting classes?)

3)How do I record the number of computations required for each algorithm?

4)What resources will help me become a stronger coder for future assignments?

Thank you for help and understanding.

*Edited 2 Years Ago by chrisl007*