long bei ge suan fa 龙算法

本人原创（delphi程序设计提高与应用）源码。本实例利用ADO组件与Access数据库连接，并可将其中的数据表中的数据生成word报表及Excel文件。源码中几乎所有的步骤都有详尽的说明，是delphi初级数据库编程人员快速进入状态的实用案例。-My original (delphi improve program design and application) source. The examples of the use of ADO components with the Access database connection, the data could be data in the table below to generate word statements and Excel documents. Source of almost all the steps are very detailed, is the primary database delphi programmers to quickly enter the state of practical cases.

通过随机数据比较各排序算法的关键字比较次数和关键字移动次数，以及执行时间，取得直观感受。 实现各排序算法，分别进行以下各组比较，并进行总结。

权限管理数据库设计，需求陈述，设计描述，数据库表的设计！-Rights management database design, requirements statements, design description, the design of database tables!

数据结构的教程-data structure Guide

哈夫曼树和哈夫曼编码： 从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。 设计要求： ⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例 ⑵ 在程序中构造四个子程序为 ① 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

链表类，提供了全套的链表处理函数-objectlist, provides a full suite of Chain Functions

用VC实现的几个常用的数据结构-with VC several commonly used data structures

将excel格式的文件销售订单导入数据库中-Will excel file sales orders into the database

日本ATR（Advanced Telecommunication Research InstituteInternational）的专门用于表情识别研究的基本表情数据库JAFFE，该数据库中包含了213幅（每幅图像的分辨率：256像素×256像素）日本女性的脸相，每幅图像都有原始的表情定义。表情库中共有10个人，每个人有7种表情（中性脸、高兴、悲伤、惊奇、愤怒、厌恶、恐惧）。 JAFFE数据库均为正面脸相，且把原始图像进行重新调整和修剪，使得眼睛在数据库图像中的位置大致相同，脸部尺寸基本一致，光照均为正面光源，但光照强度有差异。由于此表情数据库完全开放，且表情标定很标准，所以现在大多数研究表情识别的文章中都使用它来训练与测试。-Japan ATR (Advanced Telecommunication Research InstituteInternational), devoted to the basic expression of facial expression recognition research database JAFFE, the database contains 213 (each image resolution: 256 pixels × 256 pixels) Japanese women face relative to each piece of expression of both the original definition of the image. Expression library, a total of 10 individuals, each person has seven kinds of expressions (neutral face, happy, sad, surprise, anger, disgust, fear). JAFFE face database are positive phase, and the original image is re-adjust and trim, making the eye the location of the image in the database similar to the face basically the same size, ligh

这是一个有关决策树分类器中C4.5算法的原程序-This is a decision tree classifiers on which the original algorithm C4.5 procedures