The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | Apr 2017 |
| Last Sign in: | 103 Weeks Ago, 3 Days Ago |
| Questions Answered: | 4870 |
| Tutorials Posted: | 4863 |
MBA IT, Mater in Science and Technology
Devry
Jul-1996 - Jul-2000
Professor
Devry University
Mar-2010 - Oct-2016
Hello,
Could you please help?
Â
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
Â
Â
The ability to utilize and sort arrays is a critical skill in any programming language. This week’slesson will use arrays to store information. An algorithm rearranges the data from smallest tolargest 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 theabove 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. Sortthe 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.265.2 59.3 80.5 92.1 85.7 78.7 66.2 88.8 50.2 73.4
Attachments: