Maximising Algorithm Performance in .NET: Levenshtein Distance

James Turner

View at original site

With performance tricks you may not know applied to an algorithm you may never have heard of before, be prepared to learn about my journey from different array structures to pointers and SIMD to threading, as we make the journey to maximum performance together.

About the Presenter

James Turner Director of Turner Software

James is a programmer and entrepreneur with a love of cars, music, and technology.

Related Resources

Use collection initializers
Update and initialize items in old collection declarations
Rename refactoring
Would a variable by any other name read as clearly?
Extract method refactoring
Split and Organize code into DRY, discrete units.