Alternatives to `unordered_map`, `unordered_set` for C++ backend.

[czgdp1807]

AFAIK, these are slow in STL of C++. We have found some alternatives - policy based data structures (https://codeforces.com/blog/entry/60737, SparseHash by Google, abseil::flat_hash_map, boost::unordered_map (https://comp.lang.cpp.moderated.narkive.com/VPUab6if/performance-difference-between-std-unordered-map-and), https://codeforces.com/blog/entry/62393 - implementing our own hash map.

Refer #438 (comment)

[czgdp1807]

@jthorat10 After completing bubble sort and insertion sort, feel free to start working on this.

[jaythorat]

Sure.

[czgdp1807]

The benchmark in https://tessil.github.io/2016/08/29/benchmark-hopscotch-map.html can be a good source of inspiration for designing ours to analyse the approaches mentioned in the OP.

[nitinrathodsvnit]

hello sir i`m new to open source i know c++ and data structure how can i contribute

[onnhyd]

I want to work on this under GSSOC2022. Here is my discord profile DHANANJOY DEY | Contributor#7903 please please I want to work on a c++ project.