school materials management system

VC++编写的通讯录实例，实现简单数据库功能 （不用后台数据库支持）-VC prepared directories example, to achieve a simple database function (no background database support)

最小二乘逼近（least-squares approximation）得到一组离散（discrete）数据点的近似函数（approximating function），实验数据往往是用最小二乘逼近得到一条秘密曲线（curve fitting）。下面概述的是最小二乘近似作为多项式的近似函数，除了多项式外，指数的几个右公式也可以作为类似的函数使用。关于最小平方近似的计算原理，请参考市场上的数值分析书籍

倒置一个单链表，链表是带有头结点的单链表，通过不断在表头插入结点，使链表有序-Inversion of a single linked list, linked list is the first node with a single list, through constant head inserted in the table node, so that an orderly list

SQL Server 数据库结构查看程序(VC源码)-SQL Server database structure viewer program (VC-source)

利用C语言实现，8种排序算法！ 例如：插入排序、快速排序、选择排序、冒泡排序、堆排序、希尔排序、归并排序、基数排序！-using C language, eight algorithm! For example : insert sequencing, Quick Sort, select, in order of Bubble Sort, heap sort, Hill sorting, merging, in order of ranking base!

次代码是实现平衡二叉树的数据结构算法。参考的是严蔚敏c和c++数据结构书上的思想。经过调试可以连续实现删除、插入、查找算法-Sub-code is to achieve a balanced binary tree data structure algorithms. Reference is Yan Wei-Min c and c++ data structure book ideas. Debugging can be achieved through a continuous delete, insert, search algorithm

酷Grid控件示例 ... ..cj.CDX ..............cj.dbf ..............MyGrid.SCT ..............MyGrid.scx ..............MZ.DBF .............. eadme.dbf .............. eadme.FPT .............. eadme.txt ..............xsda.CDX ..............xsda.dbf -Cool Grid Control example .............. cj.CDX ...... ........ cj.dbf .............. MyGrid.SCT .............. MyGrid.scx .............. MZ.DBF .............. readme.dbf ......... ..... readme.FPT .............. readme.tx t .............. xsda.CDX .............. x sda.dbf

二叉树的建立、前序遍历、中序遍历、后序遍历-binary tree establishment, the former preorder, preorder, after preorder

磁盘文件最优存储问题，设磁盘上有n 个文件f1, f1,fn，每个文件占磁盘上1 个磁道。这n 个文件的检索概率分别是p1, p2, , pn-document optimal disk storage, disk based on documents n f1, f1, fn. each file on disk for a cylinder. N This document retrieval probability were p1, p2, and pn

迷宫算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */ -/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination.