搜索资源列表
gaijin-fenzhifa
- 此为对分治法大整数相乘的一个改进，能够给对刚开始学习算法的人一个了解的机会-This is an improved large integer multiplication of divide-and-conquer method to the beginning of the learning algorithm an understanding of the opportunity
bianzhifa-cpkdate
- 算法练习：变治法实现cpk的约会问题，附有详细说明+ppt。-The dating algorithm practice of: Variable conquer achieve cpk, with detailed descr iptions+ppt.
QuickSort
- 用快速排序（分治法），对序列{23，13，49，6，31，19，28}进行升序排列，适用于初学者，算法设计与基础，写的很通俗易懂-Quick sort (divide and conquer), the sequence {23,13,49,6,31,19,28} in ascending order, suitable for beginners, algorithm design and basic, very easy to understand
HalfSetAlgorithm
- 利用备忘录策略，采用递归分治方法实现求解半数集问题-Use memo strategies, using recursive divide and conquer method to solve half the problem set
Beep-function-to-play-music-with
- 演奏乐曲《小星星》《茉莉花》《找朋友》《上学歌》《一分钱》《征服》《沧海一声笑》《童话》《同桌的你》《小熊和洋娃娃》-Playing music "Little Star" "Jasmine", "find friends", "school song", "penny" "conquer" "Laughter In The Sea" "fairy tale", "same table for you," "Winnie and dolls"
exponential
- four different large exponential calculating algorithms: Simple algorithm (Brute force algorithm) David and conquer algorithm. Divide more and conquer algorithm. Binary exponent algorithm.
合并排序的分治算法
- 在Visual C++里编写程序，用分治法完成随机输入数列的合并排序(The program is written in Visual C++, and the sorting and sorting of random input sequence are completed by divide and conquer method)