索引顺序表查找,索引顺序查找即分块查找，是将顺序表分成诺干块。...

问题描述：设有11种不问的钱币各若干张，可用这II种钱币产生许多不同的面值。试 设计一个算法，计算给定的某个面值，能有多少种不同的产生方法。例如有1分3张，2分 3张，5分1张，则能组成7分面值的方法有：3个1分+2个2分，1个1分十3个2分，2 个1分+1个5分，1个2分+1个5分共四种。 ^编程任务：对于给定的II种不同钱币，编程计算某个给定面值能有多少种不同的产生 方法。-Problem Description: There should be 11 kinds of coins did not ask the number of beds available this II produced many different kinds of coin denominations. Try to design an algorithm to calculate a nominal value of a given that there can be many different returned. For instance, a sub-3, 2 points 3, 5 min 1, then can be composed of seven sub-par methods are: 3 1 min+2 2 points, a 1 minute 10 3 2 points, 2 1 points+1 5 points, a 2 min+1 5 minutes of four kinds. ^ Programming task: for a given II different coins, the calculation of a given program can have many different denominations is returned.

数据结构演示（tc版）-data structure demo (tc version)

pb 源码 实用例子 取硬盘序列号-pb source of practical examples from hard drive serial number

这将以最简单的方式将整个记录从一个数据库复制到另一个数据库

oracle9i错误号查询-wrong inquiry

一个用C写的迷宫小游戏，旨在对C中的指针及数据结构中的单链表和栈的使用的训练。-Using C to write a maze game, designed for C of the pointer and data structure of a single linked list and stack the use of training.

求解一个最短路径问题程序，可以参考一下求一个Dijkstra优化算法！ 谢谢了 目的是求给定两点之间的最短距离 或者改一下我的程序也行 -shortest path to solve a problem of procedure, can seek a reference Dijkstra algorithm optimization! Thank you, the purpose is scheduled for 2:00 to the shortest distance between or change my procedure OK

简单介绍了一种数据结构的构建及其使用情况-introduces a simple data structure of the building and its use

单链表简单基数排序，关键字有三个，参与排序的关键字的值为0-9之间的数-Simple single-chain base sequencing, there are three keywords to participate in the value of the keyword ranking for a number between 0-9

通过输入一串英文（权值）来构建赫夫曼树，并在当前目录下打印赫夫曼图像