Click here to Skip to main content
13,195,379 members (60,233 online)

how to find complexit of the following algorithm ?

Anderso0on asked:

Open original thread
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)
Tags: C++


When answering a question please:
  1. Read the question carefully.
  2. Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
  3. If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Let's work to help developers, not make them feel stupid.
Please note that all posts will be submitted under the The Code Project Open License (CPOL).

Advertise | Privacy |
Web02 | 2.8.171019.1 | Last Updated 26 Mar 2009
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