Skip to content

Details

All,

This talk is about presenting 20 very efficient data structures beyond well known ones like hash maps, ..

We provide:

  • a detailed description of the data structure internals

  • sample code in C++ or Java

  • computational complexity in insert / retrieve / search / delete operations

  • examples and use cases

  • ways to extend them further

We will also deal with generic ways on how to port a non-optimized data structure into a HW-optimized one.

Source code provided to attendees.

Talk in French, contents in English.

Related topics

You may also like