Aug 28 2009
Merge sort algorithm project
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.
How to :
The input parameter is
1. number (values for sorting)
2. -1000 (to start merge sort)
Tools & Knowledge :
1. C++
2. Merge sort
3. Recursive
Reqirement :
1. Microsoft .Net Framework 2.0 (22.4 MB)
2. windows
Download :
1. Merge Sort EXE
2. Merge Sort Source Code
No related posts.
Related posts brought to you by Yet Another Related Posts Plugin.