+ 2. Specify which operations run best when the list is sorted. Then briefly describe an...

  

Transcribed Image Text:

+ 2. Specify which operations run best when the list is sorted. Then briefly describe an algorithm to implement each operation using a list organized in the optimal way. (10%) Task a) Find the minimum value. b) Find the maximum value. c) Compute the arithmetic mean d) Find the median (i.e., the middle value) e) Find the mode (i.e., the value that appears the most times) Algorithm Sorted/Un -sorted? + 2. Specify which operations run best when the list is sorted. Then briefly describe an algorithm to implement each operation using a list organized in the optimal way. (10%) Task a) Find the minimum value. b) Find the maximum value. c) Compute the arithmetic mean d) Find the median (i.e., the middle value) e) Find the mode (i.e., the value that appears the most times) Algorithm Sorted/Un -sorted?

Answer rating: 100% (QA)

a Find the minimum value When the list is sorted the minimum value can be found in constant time O1 by returning the first element of the sorted array If the list is unsorted the minimum is found by i... View the full answer