Irregularity in Generic Programming by Mircea Baja

/* ACCU 2020 Programming Conference Registration is Open - see https://conference.accu.org */

The original idea of this talk is that diversity in data structures and algorithms results in generic solutions being quirky and not universal (the irregularity conjecture).

To get there, we're going to have a bit of fun with simple data structures (linked lists) and simple algorithms (linear find and partition), see what (C++ 20) concepts are, to build towards the more philosophical part on the design and usage of generic code.

About Our Speaker
Mircea Baja is a principal software engineer at Sophos, working on the next generation cybersecurity products.

All Welcome
This event is free due to the kind support of our ACCU (http://accu.org/) Members and Sponsors. ACCU Members and non-members are all welcome so spread the message far and wide. I will have ACCU Magazines (http://accu.org/index.php/journal) to give away free to new attendees.

Sponsors
This event is sponsored by Oxford Computer Consultants (https://www.oxfordcc.co.uk/) whose support of our community we very much appreciate.