What is meta? ×
Meta Stack Exchange is where users like you discuss bugs, features, and support issues that affect the software powering all 127 Stack Exchange communities.

I've made an implementation of the Dijkstra algorithm in Java and I would like to know how to calculate the complexity of the program.

I don't know if I have to ask it on SO, on Programmers or on CSTheory.SE?

Is it rather a theoretical question or it's enough about code to be on SO?

EDIT :

Some precision :

I will have to post my code in order to provide informations to calculate the complexity of the algorithm and measure the impact of my use of Java object on the complexity.

So what is the more important?

The technical part for calculate the complexity based on Java use? Or the theoretical issue of calculate complexity?

share|improve this question
    
If you are expecting answers to discuss topics like cyclomatic complexity, your question might be more suitable for Programmers Stack Exchange. –  Yannis Feb 17 '12 at 10:22
    
@YannisRizos I think about it too, I hope having some other clues. Let see what people think about it. –  alain.janinm Feb 17 '12 at 10:25
    
cstheory.se is for research-level questions, so definitely not there. SO might be okay, but that depends on what exactly and how you ask. –  Daniel Fischer Feb 17 '12 at 13:24
    
If you are facing a problem, e.g a specific bottleneck or something else that can be objectively solved and fixed, SO is the place. That being said, "How do I accurately calculate space / time complexity for any given algorithm" didn't go over so well the last time it was asked, because it was asked quite poorly. Note, it wasn't closed as off topic, but NARQ. Give it your best shot on SO, the worst case is we help you edit it and perhaps migrate it to PSE if needed. –  Tim Post Feb 17 '12 at 13:46
    
Also note, it has been covered before but not quite in the context you're describing. Take care to make the question unique and awesome, and I suspect it'll do rather well. –  Tim Post Feb 17 '12 at 13:49
    
@TimPost Thanks for the tips. I will try to compose on SO an intelligible question that point up the impact of the Java code I used, on the (known) complexity of Dijkstra algorithm. –  alain.janinm Feb 17 '12 at 14:02
    
Finally post on SO stackoverflow.com/questions/9332945/…. And was closed as NARQ... –  alain.janinm Feb 18 '12 at 9:30
add comment

You must log in to answer this question.

Browse other questions tagged .