-
-
Quick-sort.zip
Quicksort sorts by employing a divide and conquer strategy to divide a list into two sub-lists.
The steps are:
Pick an element, called a pivot, from the list.
Reorder the list so that all elements with values less than the pivot come before the pivot, ...
-
C-Sharp-MaxSubsequenceSum.zip
An implementation of the Max Sub-sequence sum algorithm using divide and conquer. Includes driver program. Perfect for students.
-
-
divide.zip
divide and conquer to find maximum subarray and index
-
-
-
-
upload.zip
the patch of conquer online (real co )
version 5072
-
6.zip
First, the longest common subsequence problem two largest sub-segment and problems (divide and conquer algorithm) Third, the largest sub-segment and the problem (dynamic programming algorithm)
-
FFT.rar
...
2.4 Solving Recurrences to Determine an Unknown Function
2.2 Multiplying Two Complex Numbers
II Sequential FFT Algorithms
3 The Divide-and-Conquer Paradigm and Two Basic FFT Algorithms
3.1 Radix-2 Decimation-In-Time (DIT) FFT
3.1.1 Analyzing the ...
-
Go To English Version 超过100万源码资源，1000万源码文件免费下载
