Re:Data structures and algorithms practice problems and thei...
by pmontra on Sunday November 26, 2017 @06:59AM
(#15780528)
In web development, almost zero relevance. They are looking for the keys under the lampost [1].
Some of those algorithms are already implemented by library functions. Others are really not relevant. However:
1. I needed some non trivial algorithm maybe once or twice in the last 5 years. Knowing you can do that in o(n) or o( log n) is handy. Knowing the solution is better :-)
2. Binary search is important. I saw a program looping through potentially 4000+ API calls to look for an element when a binary search could have nailed it down in a few hits (the server didn't have a search API for what the program had to do.)
Some of those algorithms are already implemented by library functions. Others are really not relevant. However:
1. I needed some non trivial algorithm maybe once or twice in the last 5 years. Knowing you can do that in o(n) or o( log n) is handy. Knowing the solution is better :-)
2. Binary search is important. I saw a program looping through potentially 4000+ API calls to look for an element when a binary search could have nailed it down in a few hits (the server didn't have a search API for what the program had to do.)
[1] https://en.wikipedia.org/wiki/Streetlight_effect