1. ► Quick sort always performs better than heapsort

2. ► STL map provides access in lg(n) time

3. ► In a min-heap, value at a node is always less than that of its children

4. ► Elements in hash_map are ordered

5. ► Heapify operation just takes O(lg(n)) steps

6. ► Hash map guarantees constant time value access

7. ► Merging two heaps is a O(lg(n)) operation

8. ► Heapsort relies on heap to pick the minimum or maximum element

9. ► A good hash function will be collision free

10. ► STL map is unordered

11. ► A pointer map ordering varies from one run to another

12. ► hash_map is also part of the standard C++