Click here to Skip to main content
15,883,705 members
Please Sign up or sign in to vote.
1.00/5 (1 vote)
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
Comments
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.

Hint: count how many times line 4 is executed.
 
Share this answer
 
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
 
Share this 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