Assessment weight : 3% |
Due : Week 9 |
for i from 0 to n - 2 do for j from n-1 down to i + 1 do if a[j-1] < a[j] swap a[j-1] and a[j]To test your bubleSort() method, modify again, your program which you have written for Question 6 of Lab3 to make use of an array to store user inputs, print the largest and smallest value after sorting i.e. the first and last array element.
You do not have to implement any new method for Rational class. Your applet should look and function like this : GUIRationalDriver