13,049,343 members (73,284 online)
Rate this:
Please Sign up or sign in to 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 29-Dec-12 9:23am
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.

## 2 solutions

Rate this:
Please Sign up or sign in to vote.

## 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
Rate this:
Please Sign up or sign in to vote.

## Solution 2

Hint: count how many times line 4 is executed.

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

Top Experts
Last 24hrsThis month
 OriginalGriff 135 Richard MacCutchan 110 Jochen Arndt 95 Sheila Pontes 85 Kornfeld Eliyahu Peter 70
 OriginalGriff 4,993 RickZeeland 1,934 ppolymorphe 1,753 F-ES Sitecore 1,553 Dave Kreskowiak 1,379

Advertise | Privacy | Mobile
Web02 | 2.8.170713.1 | Last Updated 1 Jan 2013
Copyright © CodeProject, 1999-2017
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