Optimising generic algorithms

Speaker: Denis Yaroshevskiy

Audience level: Intermediate

From time to time, library and application developers are faced with a common refrain: “this low-level component needs to run faster.” This is especially challenging for generic algorithms because of limitless possibilities and considerations. This talk will cover some ways to approach this problem, using some standard algorithms as examples.