Click here to Skip to main content
15,880,796 members
Please Sign up or sign in to vote.
0.00/5 (No votes)
See more:
Q.] How can we find complexity of two funtion with parallel execution of that functions?
Posted
Comments
Albert Holguin 5-Dec-11 9:24am    
Don't think you question is exactly very clear. Might want to rephrase.

Assuming you are talking of the time complexity, the complexity of two functions running in parallel is the largest of the two complexities.
 
Share this answer
 
A very general question, but I think the following link might help.
https://computing.llnl.gov/tutorials/parallel_comp/[^]

Good luck!
 
Share this answer
 
You first have to define the 'complexity of a function' in a (meaningful) way that fits your needs and then make sure that the 'parallel execution' of the functions gives you a measure of such 'complexity'.
As it is stated your questions is pretty vague.
 
Share this answer
 
http://msdn.microsoft.com/en-us/library/gg663528.aspx[^]
See here about parellel programming
 
Share this answer
 
You want complexity of a function or a algo?
 
Share this answer
 
Comments
Albert Holguin 7-Dec-11 9:18am    
How is this a solution?
RaviRanjanKr 13-Dec-11 16:17pm    
A suggestion :- you can use Have a question or Comment button to drop your message and to get Immediate response instead of posting as answer.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)



CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900