|P is for Practical|
Estimating Task Complexity VS Loudmouthby Eyck (Priest)
|on Nov 23, 2004 at 14:57 UTC||Need Help??|
Eyck has asked for the
wisdom of the Perl Monks concerning the following question:
how can one estimate complexity of task at hand?
There is this whole Computer Sciences way of doing that, O-notation etc... but it is largely theoretical and concernes with algorithms, not tasks.
Task like 'create user' is numerically trivial, but may be extremely time consuming when you're talking to Active Directory.
How can I estimate if I'm at all able to accomplish something like 'Create Interface Module For Loudmouth Library'?
that would require using Inline::C or h2xs, following on that question, how do they compare in terms of required knowledge and free time?
To clear things a bit - solving Travelling Salesmen Problem is trivial as a task, because there are easy to use libraries (like Graph::Kruskal) that solve this, and it's just a metter of massaging your data to feed them.