>algorithms dynamically find us the optimal code for doing X Likely will never happen. For example: ~Counting sort is awesome with low range on inputs. ~Qui

>algorithms dynamically find us the optimal code for doing X Likely will never happen. For example: ~Counting sort is awesome with low range on inputs. ~Quicksort on user inputs is an attack vector because of O(n^2) worse case run time (CPU consumption attacks). ~Merge Sort is nice on user inputs b/c of its static runtime. Without understanding the context of when and why sort is called, and what sort will be sorting you can't make an informed decision of what algorithm to use. A lot of this nuance escapes even very senior developers.