13,447,595 members (43,589 online)
See more:
suppose module A requires M unit of time be executed , where M is constant .
find the complexit C(n) of the following algorthim , where is size of the input data
The Algorthim :
1- Repeat for I=1 to N
2- Repeat for j=1 to N
3- Repeat for k=1 to N
4- module A
[End step 3 loop]
[End step 2 loop]
[End step 1 loop]
5- exit
(observe that algorthm use N for n)
Posted 29-Dec-12 9:23am
jibesh 29-Dec-12 16:31pm

so what's the question here? what are you upto with the coding? where you stuck? Please note that we dont work for you.
nv3 30-Dec-12 6:07am

The answer to this question is so simple that it would be really embarassing to give it away. You haven't even taken to time to get the spelling of the question title right, but expect others to help you.

## Solution 2

Hint: count how many times line 4 is executed.

## Solution 1

Sorry, we don't solve you school problems for you. By not solving them by yourself, you loose to much. The school and your assignments give you a chance to learn something. Use this chance well.

—SA

Top Experts
Last 24hrsThis month
 OriginalGriff 122 Maciej Los 90 Richard MacCutchan 70 ppolymorphe 70 Bryian Tan 60
 OriginalGriff 4,412 Maciej Los 2,517 CPallini 1,547 ppolymorphe 1,364 Richard MacCutchan 1,351