loto.rar - Program uses a 2-D dynamic array to store any
number of sets of randomly generated LOTO 6/49 numbers.
Simulation signed Lotto,2009-01-20 12:24:51,下载10次
heapsort.rar - A heap is a binary tree satisfying the following
conditions:
This tree is completely balanced.
If the height of this binary tree is h, then leaves
can be at level h or level h-1.
All leaves at level h are as far to the left as
possible.
The data associated with all descendants of a
node are smaller than the datum associated
with this node.,2009-01-20 12:16:19,下载2次
huffman.rar - Huffman codes
In telecommunication, how do we represent a
set of messages, each with an access
frequency, by a sequence of 0’s and 1’s?
To minimize the transmission and decoding
costs, we may use short strings to represent
more frequently used messages.
This problem can by solved by using an
extended binary tree which is used in the 2-
way merging problem.,2009-01-20 12:15:09,下载1次
LCS.rar - Instead of finding the longest common
subsequence, let us try to determine the
length of the LCS.
Then tracking back to find the LCS.
Consider a1a2…am and b1b2…bn.
Case 1: am=bn. The LCS must contain am,
we have to find the LCS of a1a2…am-1 and
b1b2…bn-1.
Case 2: am≠bn. Wehave to find the LCS of
a1a2…am-1 and b1b2…bn, and a1a2…am and
b b b
b1b2…bn-1
Let A = a1 a2 … am and B = b1 b2 … bn
Let Li j denote the length of the longest i,g g
common subsequence of a1 a2 … ai and b1 b2
… bj.
Li,j = Li-1,j-1 + 1 if ai=bj
max{ L L } a≠b i-1,j, i,j-1 if ai≠j
L0,0 = L0,j = Li,0 = 0 for 1≤i≤m, 1≤j≤n.,2009-01-20 12:13:12,下载3次
TSP.rar - The basic principle using the branchand-
bound strategy to solve the traveling
salesperson optimization problem (TSP)
consists of two parts.
There is a way to split the solution space.
There is a way to predict a lower bound for a
class of solutions.
There is also a way to find an upper bound of
an optimal solution.
If the lower bound of a solution exceeds this
upper bound, this solution cannot be optimal.
Thus, we should terminate the branching
associated with this solution.,2009-01-20 12:10:33,下载1次
convexhull_Grahamscan.rar - Input : A set S of planar points
Output : A convex hull for S
Step 1: If S contains no more than five points, use exhaustive searching to find the convex hull and return.
Step 2: Find a median line perpendicular to the X-axis which divides S into SL and SR SL lies to the left of SR .
Step 3: Recursively construct convex hulls for SL and SR. Denote these convex hulls by Hull(SL) and Hull(SR) respectively.
Step 4: Apply the merging procedure to merge Hull(SL) and Hull(SR) together to form a convex hull.
Time complexity:
T(n) = 2T(n/2) + O(n)
= O(n log n)
,2009-01-20 12:08:55,下载12次
gobang.zip - 這是個五子棋遊戲只要連成五顆棋子不管直得橫的或斜的都可以唷,2009-01-20 01:55:40,下载4次
LCS.rar - LCS 是一個能從輸入兩串字串當中找出最長的由左而右的順序的字元,2009-01-20 01:46:05,下载3次
convexhull.rar - The Graham scan examines the points one by one and eliminates the points which cause reflexive angles,2009-01-17 12:19:25,下载16次