The ability to utilize and sort arrays is a critical skill in any programming language. This week’s lesson will use arrays to store information. An algorithm rearranges the data from smallest to largest values. Selection Sort (8.6.2, pg. 505);. Insertion Sort (8.6.3, pg. 511);. Bubble Sort (see page 526 for a description of the Bubble Sort Algorithm).. Assignment: Create an (double) array to store the scores below. Then create a sorting class using one of the above methods. Make sure the sorting class processes double arrays (double[] arrayName;). Create a client class to call the sorting Class. Pass the array of scores to the Sorting class. Sort the array from smallest to largest and printout the sorted array. 53.5 60.3 96.2 53.3 56.4 52.7 76.4 77.5 71.0 78.2 65.2 59.3 80.5 92.1 85.7 78.7 66.2 88.8 50.2 73.4
Sun | Mon | Tue | Wed | Thu | Fri | Sat |
---|---|---|---|---|---|---|
30 | 31 | 1 | 2 | 3 | 4 | 5 |
6 | 7 | 8 | 9 | 10 | 11 | 12 |
13 | 14 | 15 | 16 | 17 | 18 | 19 |
20 | 21 | 22 | 23 | 24 | 25 | 26 |
27 | 28 | 29 | 30 | 1 | 2 | 3 |
Get Free Quote!
377 Experts Online