Divide and Conquer Algorithms and Counts
The divide, conquer and combine pattern and when it beats a direct method; a master table of recurrences and solutions; simultaneous maximum and minimum with the pairwise count ceil(3n/2) - 2 against the halving recursion (which loses for some n); second largest; fast exponentiation with its exact multiplication count; Karatsuba and Strassen multiplication counts; counting inversions during merge sort; maximum subarray by divide and conquer and by Kadane's scan; closest pair of points. All counts by script.