资源列表
ga
- 关于遗传算法的代码，很好用，经过自己的验证，可以使用-On genetic algorithm code, very good, after their own validation, you can use
2_Tree
- 二叉树的遍历算法，后序遍历的非递归实现。-2-Tree algorithm
acbrt.c
- Fast approximate cube root of a float.
asqrt.c
- Fast approximate square root of a float.
boole.c
- Determines which of the 256 Boolean functions of three variables can be implemented with three binary Boolean instructions if the instruction set includes all 16 binary Boolean operations.
compress.c
- A version with no branches in the loop. Eight insns in the loop, giving 8*32 + 2 = 258 insns worst case (however, the code above might be faster if the mask is sparse).-A version with no branches in the loop. Eight insns in the loop, giving 8*
compress_left.c
- Converts the unsigned integer k to binary character form with a blank after every fourth digit. Result is in string s of length 39. Caution: If you want to save the string, you must move it. This is intended for use with printf, and you can hav
divmnu.c
- Computes the n-m+1-halfword quotient and m-halfword remainder of n halfwords divided by m halfwords, unsigned. Max line length is 57, to fit in hacker.book.
snoob.c
- Computes the next number with the same number of one-bits. Or, the next subset of the same size as the given one.-Computes the next number with the same number of one-bits. Or, the next subset of the same size as the given one.
sparse.c
- For an array with elements 0, 2, 32, 47, 48, and 95 defined
transpose8.c
- Programs for computing the transpose of an 8x8 bit matrix. ax line length is 57 (sometimes), to fit in
transpose32.c
- Program for computing the transpose of a 32x32 bit matrix.