迪杰斯特拉算法,希望对于一些刚学c语言编程的有帮助
dijiesitela (2016-02-16, DOS, 1KB, 下载1次)
统计、求和与*排序
[目的] 熟悉循环和子程序调用的编程方法
[设计要求]
1． 从键盘随机输入十个数据，统计其中负数的个数，并在屏幕上显示出来；
2． 求出这十个数的总和， 存入数据段SUM 单元，并在屏幕上显示出来；
3． * 将这些数从小到大排序，存入 ORDER 为首址的存储区域，并在屏幕上显示出来。
4．** 编一跳转表，按键1，2，3，分别执行上述三种操作。
Statistics, Sum* Sort [purpose] loop and subroutine calls are familiar with programming [design] 1. Random input from the keyboard dozens of data, statistics on the number of negative and displayed on the screen 2. Find that the sum of ten numbers, into the data segment SUM unit and displayed on the screen 3.* These numbers will be small to large order, ORDER led into the site storage area, and displayed on the screen. 4.** Compile a jump table, keys 1,2,3, respectively, perform the three operations. (2011-10-29, DOS, 1KB, 下载10次)
有一个首地址为A的N字数组，请编程序使该数组中的数按从大到小的次序排列
A first address for the A N-word group, programmed so that the array of numbers arranged in descending order (2011-10-25, DOS, 1KB, 下载7次)
设在内存区域中有数组X和Y。X数组有X1，X2，…，X10；Y数组有Y1，Y2，…，Y10，编程序实现下面的计算：
Z1=X1－Y1，Z2=X2＋Y2，Z3=X3－Y3，Z4=X4＋Y4，Z5=X5＋Y5，Z6=X6－Y6，Z7=X7－Y7，Z8=X8＋Y8，Z9=X9－Y9，Z10=X10＋Y10。计算结果Z存放在数组Z中。
为了便于检查结果，设数组X的内容为db 22,11,22,11,11,22,22,11,22,11,0,0,0,0,0,0存放于ds：0的内存中，为了便于计算，把数组X中的数补足16个；数组Y存放于ds：16开始的16个内存中，内容为11,88,11,88,88,11,11,88,11,88,0,0,0,0,0,0，而数组Z存放于ds：32的内存空间中，且数组值初始化为0。
数组X、Y、Z都是连续存放的！
Memory regions are located in an array of X and Y. X arrays are X1, X2, ..., X10 Y array with Y1, Y2, ..., Y10, programmed to achieve the following calculation: Z1 = X1-Y1, Z2 = X2+ Y2, Z3 = X3-Y3, Z4 = X4+ Y4, Z5 = X5+ Y5, Z6 = X6-Y6, Z7 = X7-Y7, Z8 = X8+ Y8, Z9 = X9-Y9, Z10 = X10+ Y10. The results stored in an array Z in Z. In order to facilitate the inspection results, set the contents of the array X as db 22,11,22,11,11,22,22,11,22,11,0,0,0,0,0,0 stored in ds: 0 Memory , in order to facilitate the calculation, the number of array X in the complement of 16 array Y stored in the ds: 16 of 16 starting in memory, says 11,88,11,88,88,11,11,88,11, 88,0,0,0,0,0,0, and stored in the array Z ds: 32 of the memory space, and the array value is initialized to 0. Array X, Y, Z are continuous storage! (2010-04-14, DOS, 5KB, 下载1次)
C语言路由距离向量路由算法演示程序，采用TC2.0的图形方式编程模式，主要演示路由算法
C language routing Distance Vector routing algorithm demo program using the graphical TC2.0 programming model, the main demonstration of routing algorithm (2008-02-28, DOS, 42KB, 下载74次)