Suppose you have an array s of size n, where each element in s represents a different vote for class president, where each vote is given as an integer representing the student id of the candidate. without making any assumptions about who is running or how many candidates there are, design an o(n lg n) algorithm to determine which candidate receives the most votes.

given the input of the first problem, give an o(n) time algorithm to determine if some candidate received a majority (⌈n+1⌉) of the votes.

• o(n) average or expected time is ok

• so the hint is to look for the median

the answer to your question would be something called hertz. the unit of measurement called a hertz, which is one cycle per second, is used to measure clock speed. within one cycle, your computer processes, refreshes, or updates itself to the changes that it is going through. in the case of computer clock speed, one hertz equals one tick per second. the clock speed of computers is usually measured in megahertz (mhz) or gigahertz (ghz)

which functions return a valid value without any arguments?

(-blank- and -blank- return a valid value without any arguments.)

1st -blank-

today

sqrt

count

2nd -blank-

round

now

sqrt