Click here to Skip to main content
11,496,146 members (469 online)
The site is currently in read-only mode for maintenance. Posting of new items will be available again shortly.
See more: C++ C VC++
Q.] How can we find complexity of two funtion with parallel execution of that functions?
Posted 5-Dec-11 1:33am
Albert Holguin at 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.
A very general question, but I think the following link might help.[^]

Good luck!
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.
See here about parellel programming
You want complexity of a function or a algo?
Albert Holguin at 7-Dec-11 9:18am
How is this a solution?
RaviRanjankr at 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)

  Print Answers RSS
0 Sergey Alexandrovich Kryukov 10,401
1 OriginalGriff 8,910
2 Sascha Lefèvre 3,899
3 Maciej Los 3,422
4 Richard Deeming 2,600

Advertise | Privacy | Mobile
Web03 | 2.8.150520.1 | Last Updated 15 Dec 2011
Copyright © CodeProject, 1999-2015
All Rights Reserved. Terms of Service
Layout: fixed | fluid

CodeProject, 503-250 Ferrand Drive Toronto Ontario, M3C 3G8 Canada +1 416-849-8900 x 100