捕鱼达人的C++代码

Jacobi求解线性方程组、possison方程，欢迎大家提出宝贵意见。-Jacobi to solve linear equations, possison equations, welcome you to give valuable advice.

该代码是自己原创，参考编译原理的书，根据LL1文法判断过程编写而成，进行了多种判断，找左公因子，左递归，求first集，follow集，select集最终根据select集判断出是否为ll1文法，并且在过程中每个产生式是否能产生空，其select集，first集，follow集，均可打印出

CPU是计算机系统中一个十分重要的资源，本章主要介绍处理机的调度目标、策略以及评价方法等。因为处理机调度程序不可能选择全部驻留在外存的进程，因此，在调度一个进程占有处理机之前，系统必须按某种策略把外存中处于后备状态的作业选择出来，并创建进程和分配内存，为进程执行准备必需的资源。这一步称为作业调度或高级调度。作业调度的目标是尽量做到公平合理，能执行尽可能多的作业、尽快地响应时间以及高的设备利用率等。任一调度算法要同时满足这些调度目标是不可能的。大多数操作系统都是根据用户需要而采用兼顾某些目标的方法。比较常用的作业调度算法有：FCFS（先来先服务）、方法、SJP(最短作业优先)法、HRN(最高响应比)法等。这-CPU computer systems is a very important resource, this chapter introduces processor scheduling objectives, strategies and evaluation methods. Because the processor scheduling procedures could not choose Disk presence in all the process, and therefore, in the process of scheduling a possession before the processor, the system must be some kind of strategy to Disk backup were at the operational state of choice out and the process of creation and distribution of memory, the process of preparing the implementation of the necessary resources. This step as job scheduling or senior scheduling. Job Scheduling goal is to try to make it fair and reasonable to carry out the operation as much as

数值优化计算过程中常用的贝塞尔拟合法程序-Numerical optimization of the process used to be legal procedures Bessel

LDL 分解源码。从文件输入数据，编译运行后结果输出在输出文件中。-LDL decomposition source. Import data from the document, compiled the results after the operation output in the output document.

恩，就是三次样条插值，小弟刚刚学会编程，大家见谅，见谅-TU, cubic spline interpolation, younger brother had just learned programming, we apologize, apologize

对于无线网络，载波传感和相关的

CRC-ITU 查表算法 C 语言版，输入数据头指针和长度，计算其 16 位 CRC           请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

One of the world-wide cooperative computing tasks is the "Grand Internet Mersenne Prime Search" -- GIMPS -- striving to find ever-larger prime numbers by examining a particular category of such numbers. A Mersenne number is defined as a number of the form (2p–1), where p is a prime number -- a number divisible only by one and itself. (A number that can be divided by numbers other than itself and one are called "composite" numbers, and each of these can be uniquely represented by the prime numbers that can be multiplied together to generate the composite number — referred to as its prime factors.) Initially it looks as though the Mersenne numbers are all primes. Prime Corresponding Mersenne Number 2 4–1 = 3 -- prime 3 8–1 = 7