Don the Guru

Life would be easier if we had the source code.

Merge Sort Example in C++

A merge sort is a O(n log n) sorting algorithm. I show in this example how to implement a merge sort in c++ using recursion. This algorithm is a divide & conquer based algorithm.

How to Solve It Book by George Polya

George Polya Four Point Summary

Problem Solving is an art and like any art can only be learned through practicing. Here are George Polya’s four point summary steps in how to solve problems.