Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - arrays c
Search - arrays c - List
这篇文章主要是介绍一些在复习C语言的过程中笔者个人认为比较重点的地方,较好的掌握这些重点会使对C的运用更加得心应手。此外会包括一些细节、易错的地方。涉及的主要内容包括:变量的作用域和存储类别、函数、数组、字符串、指针、文件、链表等。一些最基本的概念在此就不多作解释了,仅希望能有只言片语给同是C语言初学者的学习和上机过程提供一点点的帮助。 -this article is to introduce some major review of the C language in the process I personally think that a more focused, a better grasp of these focus on C will be used more handy. In addition will include some of the details, error-prone areas. The main contents include : Scope of Variables and storage types, functions, arrays, string, target, document, etc. List. Some of the most basic concepts in this no more explanation. only hope to be able to pieces with the C language learners and the learning process on the plane for a little bit of help.
Date : 2025-12-15 Size : 6kb User : 赵东生

* 用改进的欧拉方法求解初值问题,其中一阶微分方程未y =f(x,y) * 初始条件为x=x[0]时,y=y[0]. * 输入: f--函数f(x,y)的指针 * x--自变量离散值数组(其中x[0]为初始条件) * y--对应于自变量离散值的函数值数组(其中y[0]为初始条件) * h--计算步长 * n--步数 * 输出: x为说求解的自变量离散值数组 * y为所求解对应于自变量离散值的函数值数组 -* Improved Euler method to solve initial value problems, not an order differential equation y = f (x, y)* initial conditions for x = x [0], y = y [0].* Input : f-- function f (x, y)* x pointer-- from the array variable discrete values (x [0] for the initial conditions)* y-- corresponding to the variable discrete value of the function of the array (y [0] for the initial conditions)* h-- calculated step* n-- steps* output : Solving for x that the variable array* discrete values by solving y variables corresponding to the value of the discrete function arrays
Date : 2025-12-15 Size : 3kb User : xuyan

DL : 0
系统学习C语言,包含指针,数组,函数等详细信息-A systematic study of the C language, including pointers, arrays, functions, etc. For more information
Date : 2025-12-15 Size : 3.05mb User : 蔡滇鸿

Introduction:Arrays C++ Lecture
Date : 2025-12-15 Size : 541kb User : vladimir

Arrays&Vectors C++ Lecture
Date : 2025-12-15 Size : 137kb User : vladimir
CodeBus is one of the largest source code repositories on the Internet!
Contact us :
1999-2046 CodeBus All Rights Reserved.