Chapter 4

1. If a better algorithm uses knowledge about the structure of the data, how does that apply to sorting? Is the data to be sorted by definition devoid of any structure?
   There is one fundamental thing we know here—data can be partitioned and sorted into smaller chunks, thus decreasing the complexity from O(n²) to O(n log n). There aren't any neighborhood considerations to be taken into account. And, apart from that, sorting algorithms do use additional knowledge. Time sort (used in Python) is optimized for nearly-sorted array cases. The C++ STL's sort algorithm will switch from quicksort to insertion sort for small inputs or small subpartitions of the data.

2. Is using the QStringList class a good idea? Or should you use QVector<QString> instead?
   QString is declared with Q_DECLARE_SHARED, which makes it movable. QStringList is a typedef for QList&lt...