The member variable grade is assumed to hold a real number between 0.0 and 4.0. Implement the following functions: (a) static boolean find(LinkedList roster, float g) Returns true if there is at least one student in the roster whose grade is greater than or equal to g. 3 (b) void sort(LinkedList roster) Sorts the list of students by grade in decending order. (c) Pair low_high(LinkedList roster) Returns a pair whose first member is the lowest grade and second member is the highest grade of the roster.

No, you just need to see your messages  within 24hrs, our the msg is gone. and you need to screenshot it if it's important.

The answer is a : ; ; : : : :

Choice 2.the algorithm constantly checks to see if the value in the position before is greater than the value in the current position. if there is even one instance, it will return false and stop looping.using an if-statement without } and { means that the if-statement true condition only applies for the next lineconsider  . the condition  checks if previous position is greater than or equal to current position. if it is, it will make method return false. for that example, it won't.consider  , it would return falseconsider  . it would return false