Difference between revisions of "2014/How to make generics in C: an adventure in sorting"

From Open Source Bridge Wiki
Jump to: navigation, search
(Contributed notes)
(meta info)
 
(One intermediate revision by one other user not shown)
Line 6: Line 6:
 
</span>
 
</span>
 
<!-- DO NOT CHANGE ANYTHING ABOVE THIS LINE -->
 
<!-- DO NOT CHANGE ANYTHING ABOVE THIS LINE -->
 +
 +
Presented in room B201 at 1645 on 24 jun 2014 to 24 people
  
 
Slides: https://www.dropbox.com/s/803bxptvqzixwhf/sort.pdf
 
Slides: https://www.dropbox.com/s/803bxptvqzixwhf/sort.pdf
  
(Add your notes here!)
+
Link to the sorting library in the talk: https://github.com/swenson/sort

Latest revision as of 18:14, 24 June 2014

This will be a talk on how to hack C to get generics-like support,
which we used to make a super-fast C sorting library, all in headers.
We’ll also talk about sorting in general, and the various kinds of
sorting algorithms, and why this hack helps so much.

Speaker: Christopher Swenson

Return to this session's details

Contributed notes

Presented in room B201 at 1645 on 24 jun 2014 to 24 people

Slides: https://www.dropbox.com/s/803bxptvqzixwhf/sort.pdf

Link to the sorting library in the talk: https://github.com/swenson/sort