How about a book about the most practical algorithms e.g. with real world examples when they can be useful. 

For example binary search has a good practical example because its basically what git bisect is.

Quick sort and merge sort for example are however not that practical to implement yourself (beside learning about them) since most of the time you either save the data ordered, use a data base query to order the data (which is using the most efficient combination of sorting algorithms anyway) or use a hash map which does not need to be sorted.

Those should still be covered just with the information why its mostly not necessary to implement them yourself.