The Pragmatic Programmer

by Andy Hunt

If you have an algorithm that is O(n2), try to find a divide and conquer approach that will take you down to O(n lg(n)).