试验要求: 已知A，B和C为三个递增有序的线性表，现要求对A表作如下操作：删去那些既在B表中出现又在C表中出现的元素。 （1） 各线性表采用顺序存储结构； （2） 题中任一线性表中的元素值可以相同。 2.线性表中的元素为实数,线性表的长度元素由用户输入. 3.试验执行的命令包括:构造线性表LA,LB,LC.在LA中查找并删除既在B表中出现又在C表中出现的元素.输出删除后LA的结果.
标签：
上传时间： 2016-03-24
上传用户：xieguodong1234
upsd_flash.c These functions are provided to help you develop your initial code. They are optimized for speed rather that size. As a result, you will see very few nested function calls. If speed is not critical, you can use function calls for common tasks (like dat polling after writing a byte to Flash) The penalty is the extra processor time to make the nested calls.
标签： upsd_flash functions are provided
上传时间： 2013-12-23
上传用户：Andy123456
C程序设计语言于1978年出了第一版，此后，计算机世界经历了一场革命，C语言也有了合理的变化。1988年美国国家标准学会就C语言的主义制订出了ANSI C标准。本书第二版就是按这个标准来描述C语言的。全书八章，分别分：1.指导性绪论；2.数据类型、运算符与表达式；3.控制流；4.函数与结构；5.指针与数组；6.结构；7.输入输出；8.UNIX系统界面。书后附录为：A.参考手册；B.标准库；C.语言
上传时间： 2014-01-10
上传用户：tuilp1a
本文从英文C–FAQ (2004 年7 月3 日修订版) 翻译而来。本文的中文版权为 朱群英和孙云所有。本文的内容可以自由用于个人目的，但是不可以未经许可出 版发行。英文版权为Steve Summit 所有，详情见下面的英文版权说明。 The English version of this FAQ list is Copyright 1990-2004 by Steve Summit. Content from the book 《C Programming FAQs: Frequently Asked Questions》is made available here by permission of the author and the publisher as a service to the community. It is intended to complement the use of the published text and is protected by international copyright laws. The on-line content may be accessed freely for personal use but may not be republished without permission.
上传时间： 2013-12-19
上传用户：LouieWu
计算电磁学的３维矢量有限元程序 EMAP-3 is a vector (edge element) code. Vector codes are generally not affected by spurious modes and have other inherent advantages. The code is written in the C programming language and can be compiled and run on PCs, workstations, or mainframes.
标签： generally affected element Vector
上传时间： 2016-04-03
上传用户：1583060504
多项式曲线拟合 任意介数 Purpose - Least-squares curve fit of arbitrary order working in C++ Builder 2007 as a template class, using vector<FloatType> parameters. Added a method to handle some EMathError exceptions. If do NOT want to use this just call PolyFit2 directly. usage: Call PolyFit by something like this. CPolyFit<double> PolyFitObj double correlation_coefficiant = PolyFitObj.PolyFit(X, Y, A) where X and Y are vectors of doubles which must have the same size and A is a vector of doubles which must be the same size as the number of coefficients required. returns: The correlation coefficient or -1 on failure. produces: A vector (A) which holds the coefficients.
标签： Least-squares arbitrary Purpose Builder
上传时间： 2013-12-18
上传用户：宋桃子
Kiss FFT is a small and simple FFT library. It has no complicated platform-specific optimizations, can do either fixed or floating point with just a recompile, and is efficient enough for all but the most demanding applications.
标签： platform-specific optimizations complicated FFT
上传时间： 2016-04-07
上传用户：h886166
CForms, by Lars Berntzon (Stockholm, Sweden), is a tool for building interactive forms-driven applications. CForms applications can run on nany type of library supported by the "curses" library. CForms uses a language-based design to define forms. An application may contain C source modules, field pictures, field definitions, literals, and events. CForms applications must be compiled with the CFC compiler and linked with the CFL linker.CForms runs on most Unix SYSV compatible platforms including SunOS, Dell-SVR4, and Diab SYSV.3. It requires a curses library and yacc or GNU Bison. CForms version 2.1 is now available as volume #402 in the CUG Library.
标签： forms-driven interactive Stockholm Berntzon
上传时间： 2013-12-20
上传用户：himbly
Nagios is a powerful host and service monitoring program designed to run on most *NIX systems. It is written in C and designed to be fast and flexible. It has the ability to contact administrators via email, pager, or other user-defined methods.
标签： monitoring designed powerful service
上传时间： 2016-04-11
上传用户：lepoke
编程题（15_01.c） 结构 struct student { long num char name[20] int score struct student *next } 链表练习： (1).编写函数struct student * creat(int n),创建一个按学号升序排列的新链表,每个链表中的结点中 的学号、成绩由键盘输入，一共n个节点。 (2).编写函数void print(struct student *head),输出链表，格式每行一个结点，包括学号，姓名,分数。 (3).编写函数struct student * merge(struct student *a,struct student *b), 将已知的a,b两个链表 按学号升序合并，若学号相同则保留成绩高的结点。 (4).编写函数struct student * del(struct student *a,struct student *b),从a链表中删除b链表中有 相同学号的那些结点。 (5).编写main函数，调用函数creat建立2个链表a,b,用print输出俩个链表；调用函数merge升序合并2个 链表，并输出结果；调用函数del实现a-b,并输出结果。 a: 20304,xxxx,75, 20311,yyyy,89 20303,zzzz,62 20307,aaaa,87 20320,bbbb,79 b： 20302,dddd,65 20301,cccc,99 20311,yyyy,87 20323,kkkk,88 20307,aaaa,92 20322,pppp,83
上传时间： 2016-04-13
上传用户：zxc23456789
