Assignment different types of java sorts
1. A (non-recursive) insertion sort method: Use the following header:
public static void insertionSort (int[] a, int start, int end)
Take the algorithm from class and write the code so that it sorts only positions a[start] to a[end-1]
in array a, not touching any other position in the array.
2. A plain recursive merge sort method: Use the following header:
public static void mergeSort (int[] a, int start, int end, int[] temp)
Use the algorithm from class to recursively merge sort a[start] to a[end-1].
3. A hybrid version of the recursive merge sort method: Use the following header:
public static void hybridMergeSort (int[] a, int start, int end, int[]
temp, int breakpoint)
This method works just like recursive merge sort, except that the base cases for the hybrid method is
any list of size breakpoint or less. If a[start] to a[end-1] is more than breakpoint items, then
hybridMergeSort does the same thing as the normal merge sort recursive case. (Make sure your
recursive calls are to hybridMergeSort, NOT to mergeSort.) If a[start] to a[end-1] contains no
more than breakpoint items, then hybridMergeSort calls your insertion sort method to sort a[start]
to a[end-1]. (Make sure your recursive calls are to hybridMergeSort, NOT to mergeSort.)
4. A plain recursive quick sort method: Use the following header:
public static void quickSort (int[] a, int start, int end )
1
This method uses the quick sort algorithm discussed in class to sort a[start] to a[end-1]. It must
choose its pivot using the median-of-three technique in the (sub)list to be sorted. Also, the base cases
for this plain method are as follows:
Lists of zero elements and lists of one element: Since these lists are already sorted, you don't need to
do anything to sort them; and
Lists of two elements: If the two elements are not in sorted order, swap them.
and
5. A hybrid recursive quick sort method:
Hi my friend,
I am strong in algorithm analysis and implementation. I am familiar with different data structures and the time and space complexity of different algorithms. I have deep insight into recursion, dynamic programming, sorting, string manipulation algorithms and etc. I have done many algorithm analysis and design tasks before and I am convinced that I can do the project with high quality.
Wait for your response
Thank you
BR
I am very proficient in java. I have 12 years java developing experience. I have worked for 5 years, my work is online game developing, and mainly focus on server side, the language is java under linux OS, sometimes use c++ a little. So, programming in java is never a problem. I used java to make many great projects. For example, I made the tools which can convert PWScript(a script language created by our company) to c++ files. I made our own mobile games, and i am mainly responsible for the server side, and it was built using java. I can even show you the mobile game client. Please let expert help you.
I hope you understand that this is a 5-10 hour of project and you are ready to shell out anywhere from $100 to $150.
If its fine with you, then lets start !
Hello I am a fourth year student of Tel Aviv University. I love the algorithms and data structures, I would help you gladly and assure in an excelent grade!
I'm an expirienced Java programmer and I can do this task for you easily and swiflty. I have a lot of expirience in such projects and lower demands then most of the other bidders.