University of Cambridge > Talks.cam > Computer Laboratory Tech Talks > Quicker Sorting

Quicker Sorting

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Jan Samols.

Quicksort is a well-known sorting algorithm used to implement sort functionality in many libraries.

This talk isn’t really about the algorithm itself but rather about how to actually create an efficient implementation of the algorithm: a text-book implementation of the algorithm actually is not that quick (even if the pivot is chosen cleverly). It takes paying some attention to detail to improve the implementation significantly.

This talk starts with a simple implementation and makes incremental improvements to eventually yield a proper generic and fast sorting function. All code will be in C++ but it should be possible to follow the majority of the reasoning with knowledge of another programming language.

As well as hearing from Dietmar Kuhl, lunch will be provided.

Dietmar is a Senior Developer in the financial industry working at Bloomberg LP, one of the moderators of comp.lang.c+.moderated, and frequent attendee of the C+ committee meetings and the ACCU conferences(typically also presenting at ACCU ).

This talk is part of the Computer Laboratory Tech Talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2017 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity