Lab 2. Traditional Sorting Algorithms
排序算法代写 Implement the following traditional sorting algorithm in Java and test your code using the following array testA, testB.
1.Implement the following traditional sorting algorithm in Java and test your code using the following array testA, testB. 排序算法代写
1.1.Selection Sort
1.2.Rank Sort
1.3.Insertion Sort
- testA = [1, 62, 81, 0, 23, 55, 76, 87, 20, 54, 65, 76, 1]
- testB = [(71, 2); (64, 8); (31, 56); (98, 1); (3, 6); (59, 837); (49, 58); (61, 8)], where we consider the first number is the key element
Hint: testB requires a multi-dimensional array to store the input data. However the sorting should be only based on the key element which is first element. 排序算法代写
2.Now we are going to look at a new comparison sorting algorithm, the idea behind this algorithm is: 排序算法代写
- It is a simple sorting algorithm.
- It will repeatedly step by step go through the whole list, comparing each pair of adjacent items and swapsthem if they are in the wrong order.
- The process of going through the list is repeated until no swaps are needed, which indicates that the list is sorted.
Try to understand the idea and implement it in Java. Use testA and testB to validate your program. What is worst and best complexity for your program in big O notation? 排序算法代写
Submission: Submit a Single java file name lab2 (or anything else). The file should have the implementation of the sorting algorithms on question 1 and question two, one method for each of the algorithms. And a main method where you call your sorting methods on both testA and testB.
In your java file type in the answer of the big O notation for second question in a comment. For example have it like following: %%% big O notation is ….. 排序算法代写
