title: Complexity of algorithms of different programming paradigms
body: <p>I know that most programming languages are Turing complete, but I wonder whether a problem can be resolved with an algorithm of the same complexity with any programming language (and in particular with any programming paradigm).</p>
  
  <p>To make my answer more explicit with an example: is there any problem which can be resolved with an imperative algorithm of complexity <code>x</code> (say <code>O(n)</code>), but cannot be resolved by a functional algorithm with the same complexity (or vice versa)?</p>
  
  <p><strong>Edit:</strong> <em>The algorithm itself can be different.</em> The question is about the complexity of solving the problem -- using any approach available in the language.</p>