Merge sort algorithm project
August 28th, 2009
No comments
The main idea of merge sort is separate big problem to many small problem. Then separate small problem to smallest one so the program will be solve many smallest one and group it to a bigger one. Solved and group again and again. Finally the answer will be appear.
Merge sort is an O(n log n) with both best and worst case.
