BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Quicker Sorting - Dietmar Kuhl\, Bloomberg
DTSTART:20171018T120500Z
DTEND:20171018T131500Z
UID:TALK84661@talks.cam.ac.uk
CONTACT:Jan Samols
DESCRIPTION:Quicksort is a well-known sorting algorithm used to implement 
 sort functionality in many libraries. \n\nThis talk isn't really about the
  algorithm itself but rather about how to actually create an efficient imp
 lementation of the algorithm: a text-book implementation of the algorithm 
 actually is not that quick (even if the pivot is chosen cleverly). It take
 s paying some attention to detail to improve the implementation significan
 tly. \n\nThis talk starts with a simple implementation and makes increment
 al improvements to eventually yield a proper generic and fast sorting func
 tion. All code will be in C++ but it should be possible to follow the majo
 rity of the reasoning with knowledge of another programming language.\n\nA
 s well as hearing from Dietmar Kuhl\, lunch will be provided.\n\nDietmar i
 s a Senior Developer in the financial industry working at Bloomberg LP\, o
 ne of the moderators of comp.lang.c++.moderated\, and frequent attendee of
  the C++ committee meetings and the ACCU conferences(typically also presen
 ting at ACCU).\n
LOCATION:FW26\, Computer Laboratory
END:VEVENT
END:VCALENDAR