springdata

比较简陋的数据库应用,唯一能看的就是对ODBC的封装-Comparison of simple database application, is the only way to look at the package of ODBC ...

一个俄国人实现的数据库系统，同时他的网站上还有一个实时数据库系统-Russian achieve a database system, while the site includes a real-time database system

从键盘上输 入一串正整数， 最后输入－1作为输入结束的标志。以这些正整数的值作为二叉排序树中的结点的数据场之值，建立一棵二叉排序树要实现排序二叉树的插入。采取叶子插入法，即新插入的节点均为改二叉树的叶子节点，且满足中序有序性。-From the keyboard to enter a string of positive integers, the last input-1 as the input end of the sign. These are integer values as binary sort tree nodes in the data field" s value, and the establishment of a binary sort tree to achieve binary tree insertion sort. To leaf insertion method, that the new nodes are inserted to change the binary tree leaf node, and in order to meet the orderliness.

该软件可以制作百威收银系统全系列的购物券单个生成和批量生成，生成数据为随机数据

生成数据库链接和sql语句的工具,帮助不熟悉sql的网友应用sql-generation database links sql statement and the tools to help not familiar with the sql netizens application sql

高斯列主元消元法， 这只是我个人的一种解法，仅供参考。-out PCA Gaussian Elimination Act, this is my personal one solution for reference.

数据结构课程实验中所编的判断哈夫曼编码.参考可用-experimental data structure courses, which include the judgment Huffman coding. Reference available

1采用了tcp通信。 2实现自由选择主辅库。 backup:数据库监视备份软件(backup.exe,backup.ini,backup.log,sendclient.log)-One uses tcp communication. 2 Des realize freedom to choose the main library. backup: backup software, database monitoring (backup.exe, backup.ini, backup.log, sendclient.log)

模拟机场跑道上飞机起飞，VC实现，适合研究数据结构算法 -Simulated airport runway on the plane to take off, VC achieved, appropriate to study the data structure algorithms

哈夫曼树和哈夫曼编码： 从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。 设计要求： ⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例 ⑵ 在程序中构造四个子程序为 ① int createhtree(HTree *t) /*根据输入的字符及其权值建立哈夫曼树*/ ② void coding(HTree *t, char *code) /*对哈夫曼树进行编码*/ ③ void printhtree(HTree *t, int* path) /*中序打印树*/ ④ void printcode(HTree *t) /*输出个字符的哈夫曼编码*/ -Huffman tree and the Huffman coding: input from the terminal a number of characters and their corresponding integer, will be an integer as node weights, the establishment of Huffman tree, and then on the characters Huffman. Finally print Huffman tree and the corresponding Huffman. Design requirements: ⑴ Huffman and Huffman coding is that the reference materials storage ⑵ examples constructed in the procedure for the four subroutines ① int createhtree (HTree* t)/* input characters in accordance with its right value the establishment of Huffman tree*/② void coding (HTree* t, char* code)/* Huffman tree to encode*/③ void printhtree (HTree* t, int* path)/* Pri