计量单位算法和数据结构分配1，
UoM Algorithms and Data Structures Assignment 1, (2023-10-08, C, 0KB, 下载0次)
为以太坊区块链实现BF跳过索引。
Implementation of BF skip indexes for the Ethereum blockchain. (2023-09-20, Jupyter Notebook, 0KB, 下载0次)
给定n个矩阵构成的一个链<A1,A2,…,An>其中i 1,2,…,n,矩阵Ai的维数为pi-1pi,对乘积A1
A chain of given n Matrices (2018-09-05, C++, 3KB, 下载0次)
对顺序表元素就地逆置，将线性表（a1,a2,……,an）逆置为（an,an-1,……,a1）。
The sequential table element is placed in place, and the linear table (A1, A2,... An) inversed (an, an-1,... A1). (2018-01-13, C/C++, 489KB, 下载1次)
现有喜串定义如下。a 与b 互为喜串需满足以下两个条件之一： 1. a 和b 相同。 2. 将a 分成a1 与a2 两个等长串，b 分成b1 与b2 两个等长串，其子串需满足以下两个 条件之一： a) a1与b1互为喜串且a2 与b2 互为喜串。 b) a1与b2互为喜串且a2 与b1 互为喜串。 任务： 判断给定的两个串是否互为喜串
Hi existing string defined below. a and b mutually hi string must meet one of the following two conditions: 1. a and b are the same. 2. Place a a1 and a2 into two equal length strings, b b1 and b2 into two equal length strings, which substring must meet one of two conditions: a) a1 and a2 and b1 string hi to each other and b2 mutual hi string. b) a1 and a2 and b2 each other hi string hi string and b1 each other. Task: to determine whether a given two strings string hi to each other (2015-11-17, Visual C++, 1KB, 下载3次)
用栈逆置一个单链表请设计一个算法，利用一个栈，利用一个栈将一个单链表(a1，a2，…，an)(其中n≥0)逆置为(an，an-1，…，a1)
A single linked list with a stack inverse set design an algorithm using a stack using a stack in a single linked list (a1, a2, ..., an) (where n ≥ 0) the inverse set (an, an-1, ..., a1) (2012-12-23, Visual C++, 1KB, 下载1次)
算法的完整实验报告，内容包含：提公因子，排序和BF/BP算法比较 内含截图和源代码
Complete experimental report of the algorithm includes: mention common factor, sort and BF/BP algorithm contains screenshots and source code (2012-05-21, WORD, 209KB, 下载5次)
一元多项式A = anxn + … + a1x + a0, B = bnxn + … + b1x + b0，根据运算符+、-、*，分别计算A + B、A - B、A * B。
A polynomial A = anxn+ ...+ a1x+ a0, B = bnxn+ ...+ b1x+ b0+ operator,-,*, respectively, to calculate the A,+ B, A- B, A* B. (2012-05-20, Visual C++, 1KB, 下载2次)
经典算法：已知树T中结点的前序和中序序列分别放在字符型数组a1，a2中，试编写构造此二叉树的算法。
The classical algorithm: the known tree T node in the preorder and inorder sequence on the character array a1, a2, try to write the constructed binary tree algorithm. (2012-03-25, Visual C++, 2KB, 下载2次)
学生成绩管理系统 数据结构二叉树实现。C++编程语言
the manage of the student s grade. (2012-03-17, Visual C++, 935KB, 下载10次)
给定N（1≤N≤32767）天的营业额a1,a2,a3,……an. 定义最小波动值：该天的最小波动值=min{|该天以前某一天的营业额-该天营业额|}. 特别地，第一天的最小波动值即为a1. 试求N天的最小波动值之和。
Given N (1 ≤ N ≤ 32767) day turnover a1, a2, a3, ... ... an. Defines the minimum volatility value: the smallest fluctuations in the value of the day = min {| one day before the day s turnover- the day turnover |}. in particular, the first day shall be the minimum fluctuations in the value of a1. find the N-day fluctuations in value and the minimum. (2012-01-18, Visual C++, 1KB, 下载2次)
分治法排序，给定长度为n的一个序列，对其进行快速排序和求第i小数
(1) Input: A sequence of n numbers <a1, a2, . . .,an>.
Output: A permutation (reordering) <a1’, a2’, . . .,an’> of the input sequence such that a1’ a2’ . . . an’
(2) Input: A set A of n (distinct) numbers and a number i, with 1 ≤ i ≤ n.
Output: The element x∈ A that is larger than exactly i- 1 other elements of A.
(2011-12-31, C/C++, 2485KB, 下载4次)
随机生成10000个数使用快速排序，插入排序，和归并排序并保存文件，并且输出各自的运算时间
Input: A sequence of n numbers <a1, a2, . . .,an>.
Output: A permutation (reordering) <a1’, a2’, . . .,an’> of the input sequence such that a1’ a2’ . . . an’
(2011-12-31, C/C++, 2485KB, 下载6次)
SSD 6 e6作业答案 绝对好用 欢迎大家下载使用
SSD 6 e6 answer is absolutely easy to use operating (2011-12-21, C/C++, 19KB, 下载3次)
BF与KMP算法的比较，通过计算时间进行比较。C语言实现。
compare BF and KMP using C. (2011-10-20, C/C++, 13KB, 下载6次)
实现字符串的查找功能：BF算法，KMP算法，对上述两个算法进行时间复杂性分析并设计实验程序验证分析结果
Find function for string: BF algorithms, KMP algorithm, the two algorithms of time complexity analysis and experimental design analysis of program verification (2011-01-11, Visual C++, 25KB, 下载16次)
问题描述与实验目的
给定8*8方格棋盘，求棋盘上一只马从一个位置到达另一位置的最短路径长。
注意马是走“日”形的。
输入
输入有若干测试数据。
每组测试数据仅1行，每行上有2个方格pos1、pos2，之间用一个空格隔开，每格方格表示棋盘上的一个位置，该位置由表示列的1个字母（a-h）及表示行的一个数字（1-8）构成，如“d7”表示第4列第7行。
输出
对输入中每行上的2个方格pos1、pos2，输出马从位置pos1跳到pos2所需的最短路径长。如“a1==>a2: 3 moves”表示从位置a1跳到a2所需的最少步数是3。
注意：按输出样例所示格式输出，如“a1==>a2: 3 moves”中冒号后有一个空格，再跟着所需的最少步数。
实验结果
输入样例
a1 a2
a1 a3
a1 h8
g2 b8
输出样例
a1==>a2: 3 moves
a1==>a3: 2 moves
a1==>h8: 6 moves
g2==>b8: 5 moves
Description and purpose of the experiment
8* 8 grid for a given board, find the board a horse from one location to another location to reach the shortest path length.
Note that horse is to take the "day" shape.
Input
Enter a number of test data.
Only 1 line of each test data, each line has 2 squares pos1, pos2, separated by a space, each grid square, said a board position, the position of column 1 by the said letters ( ah), and that the line of a number (1-8) form, such as "d7" said the line 7 column 4.
Output
Each line in the input box on the two pos1, pos2, output horse to jump from position pos1 pos2 shortest path length required. Such as "a1 ==> a2: 3 moves" that jump from position a1 a2 minimum required number of steps is 3.
Note: The sample shown by the output format of the output, such as "a1 ==> a2: 3 moves" in a space after the colon, and then follow the required minimum number of steps.
Experimental results
Input sample
a1 a2
a1 a3
a1 h8
g2 b8
Sample Ou (2010-11-08, Visual C++, 850KB, 下载18次)
利用线性表实现一个一元多项式Polynomial
f(x) = a0 + a1x + a2x2 + a3x3 + … + anxn
The realization of a linear form of Multinomial Polynomial f (x) = a0+ a1x+ a2x2+ a3x3+ ...+ anxn (2010-08-19, Visual C++, 974KB, 下载3次)
字符串匹配算法-BF算法，它是字符串匹配的最简单算法，适合入门时参考。
String matching algorithm-BF algorithm, which is the most simple string matching algorithm, suitable for entry-reference. (2008-06-02, Visual C++, 1KB, 下载40次)
ＢＦ和ＫＭＰ算法实例，曾经的作业，希望对你有点帮助
BF and KMP algorithm example, once the operation, and I hope to you a little help (2006-06-21, C/C++, 1KB, 下载10次)