### computing and linear time median find algorithm

Posted:

**Wed Jan 28, 2015 8:23 pm**Hey guys, I have 2 problems I couldn't answer in my readings and was wondering if i could get some help:

1) Consider the problem, of computing N!=1*2*...*N. If N is an n-bit number, how many bits long is N! approximately, in Θ(. ) notation? Give an algorithm to compute N! and analyze its running time.

P.s. Θ is theta

2) So I know that the linear-time median find algorithm; groups the elements of the set for which the median is to be found into groups of 5:

the question asks how I would Analyze the running time of the algorithm if the groups were made of 7 elements instead of 5?

Thanks guys,

-Bash

1) Consider the problem, of computing N!=1*2*...*N. If N is an n-bit number, how many bits long is N! approximately, in Θ(. ) notation? Give an algorithm to compute N! and analyze its running time.

P.s. Θ is theta

2) So I know that the linear-time median find algorithm; groups the elements of the set for which the median is to be found into groups of 5:

the question asks how I would Analyze the running time of the algorithm if the groups were made of 7 elements instead of 5?

Thanks guys,

-Bash