most function - Take 2
This exercise is for collaborative work during class. Do not fill out early!
Sign in to Google to save your progress. Learn more
Consider the following problem.  The function most has one parameter nums, a list of integers. This function returns the number that appears the most in the list.
For example, the call most([3,4,2,2,3,2]) returns 2, as 2 appears more than any other number.

Consider two possible solutions to most. Both of these functions work correctly.

If there are N numbers of which M are unique, how many steps does function most take? *
If there are N numbers of which M are unique, how many steps does function most2 take? *
Names and Netids below
Names (comma separated) *
netid *
netid (partner)
netid (partner)
netid (partner)
Submit
Clear form
Never submit passwords through Google Forms.
This content is neither created nor endorsed by Google. Report Abuse - Terms of Service - Privacy Policy