> In the case of algorithms is the best algorithm always
> the best solution to the problem,be the algorithm with
> a constant run time or randomised algorithm.
> i.e is the best solution always the optimal solution
> for a problem.
> how can we argue -either way?
There is a field of mathematics (Algorithmics) dedicated to this
question. I would try and answer, but I don't understand it well enough,
and in any case it is a year-long course :)

Reply via email to