Implement a high-performance LRU Cache in C++ using std::list for double-linked list ordering and std::unordered_map for O(1) key lookups.
Build an efficient Prefix Tree (Trie) in C++ supporting fast word insertion, full match search, and prefix matching.
Implement a template-based binary search algorithm in C++ and compare it with the Standard Template Library (STL) algorithms std::binary_search and std::lower_bound.
Implement the high-performance QuickSort divide-and-conquer sorting algorithm in C++ using in-place median/pivot partitioning.