CSIS-385: Analysis of Algorithms
pp 219-222: Merge Sort ***** Know the merge function and recursive mergesort function. Divide and conquer, bottom up recursion; O(n log n) in the worst case. pp 226-231: Closest-pair Problem. O(n2) pairs to consider, yet Divide & Conquer yields O(n log n) algorithm. see the PowerPoint Presentation Chapter 6: Sorting. pp 239-241: Insertion Sort ................
................
To fulfill the demand for quickly locating and searching documents.
It is intelligent file search solution for home and business.