Graph theory is a good example of this - the asymptotically fastest minimum spanning tree algorithm was made possible by Hopcroft and Karp just drawing weird data structures on a chalkboard until union-find popped out, which gives you near-linear time MST.
