A question to computer science students/computer scientists

Is there a law that links algorithm efficiency to (big O) to the complexity of the implementation?

I’ve been thinking, efficient algorithms are generally larger in implementation than simple ones (selection sort vs heapsort). If there was a more reliable way to measure the complexity of the implementation (the resulting program) than length (LoC) or any other existing method, this could have been tested.

EDIT: by a “reliable way to measure the complexity” I mean, in any language (language independent). Just to mathematically measure the amount of work that a program does.

1. techniques22hk liked this
2. lambda-dusk reblogged this from ivogeorgiev and added:

   It all depends on...implementation language. In Haskell, for example, implementations...

3. ivogeorgiev posted this