•
•
•
•
What is DaniWeb IT Discussion Community?
You're currently browsing the Computer Science and Software Design section within the Software Development category of DaniWeb, a massive community of 456,472 software developers, web developers, Internet marketers, and tech gurus who are all enthusiastic about making contacts, networking, and learning from each other. In fact, there are 2,795 IT professionals currently interacting right now! Registration is free, only takes a minute and lets you enjoy all of the interactive features of the site.
Please support our Computer Science and Software Design advertiser: Programming Forums
Views: 932 | Replies: 5
 |
•
•
Join Date: Sep 2007
Posts: 6
Reputation: 
Rep Power: 0
Solved Threads: 0
Newbie Poster
time and complexity how much time this algoritham takes in theta notation
a <---- 0
for i <------1 to n do
for J <........ 1 to i do
for k <-------j to n do
a = a+1
a <---- 0
for i <------1 to n do
for J <........ 1 to i do
for k <-------j to n do
a = a+1
•
•
Join Date: Aug 2006
Location: Egypt
Posts: 763
Reputation:
Rep Power: 4
Solved Threads: 59
Master Poster
I think not less than 2N.
Right?
Right?
B.Sc Computer Science, Helwan University
Microsoft Student Partner
Personal blog http://ramymahrous.blogspot.com/
Arabic technical blog http://fci-h-ar.blogspot.com/
English technical blog http://fci-h.blogspot.com/
Microsoft Student Partner
Personal blog http://ramymahrous.blogspot.com/
Arabic technical blog http://fci-h-ar.blogspot.com/
English technical blog http://fci-h.blogspot.com/
•
•
Join Date: Aug 2007
Location: Adelaide, South Australia
Posts: 428
Reputation:
Rep Power: 3
Solved Threads: 53
Posting Pro in Training
a -> 1 step
For i = 1 to n -> takes n steps -> n+1 steps so far -> the 1 is negligible as n gets big so approx n steps so far
For j = 1 to i -> takes i steps for each n -> i*n so far -> approx n*n so far
For k = 1 to j -> takes j steps for each n*n -> j*n*n so far -> approx n*n*n so far
a = a+1 -> 1 step for each n*n*n -> 1*n*n*n
= n^3
For i = 1 to n -> takes n steps -> n+1 steps so far -> the 1 is negligible as n gets big so approx n steps so far
For j = 1 to i -> takes i steps for each n -> i*n so far -> approx n*n so far
For k = 1 to j -> takes j steps for each n*n -> j*n*n so far -> approx n*n*n so far
a = a+1 -> 1 step for each n*n*n -> 1*n*n*n
= n^3
•
•
Join Date: Aug 2006
Location: Egypt
Posts: 763
Reputation:
Rep Power: 4
Solved Threads: 59
Master Poster
yea darkgen, you're right I think your solution is eligable
B.Sc Computer Science, Helwan University
Microsoft Student Partner
Personal blog http://ramymahrous.blogspot.com/
Arabic technical blog http://fci-h-ar.blogspot.com/
English technical blog http://fci-h.blogspot.com/
Microsoft Student Partner
Personal blog http://ramymahrous.blogspot.com/
Arabic technical blog http://fci-h-ar.blogspot.com/
English technical blog http://fci-h.blogspot.com/
•
•
Join Date: Sep 2007
Posts: 6
Reputation:
Rep Power: 0
Solved Threads: 0
Newbie Poster
thanks for reply especially darkagn
|
•
•
•
•
•
•
•
•
DaniWeb Computer Science and Software Design Marketplace
•
•
•
•
Currently Active Users Viewing This Thread: 1 (0 members and 1 guests)
Linear Mode
•
•
•
•
ajax asp blog business software computer dell design developer development erp systems experiment firefox howto india intel internet it java linux media microsoft mmorpg msdn networking news office open open-source operating programming project management rss science security software software selection source sql sun super system technology evaluation toread vista warez web wiki windows xp
- Time complexity of algorithm (Computer Science and Software Design)
- calculate time complexity of the algorithm (Computer Science and Software Design)
- Time Complexity Problem -Urgent (Computer Science and Software Design)
- I hit a brick wall-- time complexity problem (Computer Science and Software Design)
Other Threads in the Computer Science and Software Design Forum
- Previous Thread: computer architecture simulation
- Next Thread: alog for binomial coefficients
