One thing:

In engineering and in programming one thing matters the most; efficiency. If one has to write 50 lines of code for a specific function while another fellow uses only 2 lines then the former will be inefficient and possibly laggy.

Judging an algorithm by length is not always a good idea. The most efficient algorithms are often fairly complicated in practice. Examples:

• Bubblesort vs quicksort
• Matrix multiplication. BLAS and LAPACK are humongous libraries more or less specializing in doing matrix multiplication efficiently.
• Multiplication. Karatsuba multiplication is more efficient than the normal long multiplication taught in schools. The advantage is only noticeable with large inputs.