代码搜索：2
找到约 10,000 项符合「2」的源代码
代码结果 10,000
www.eeworm.com/read/411671/11234319
m sqrtm_2by2.m
function X = sqrtm_2by2(A)
%SQRTM Matrix square root.
% X = SQRTM_2by2(A) is the principal square root of the matrix A, i.e. X*X = A.
%
% X is the unique square root for which ev
www.eeworm.com/read/411670/11234358
m sqrtm_2by2.m
function X = sqrtm_2by2(A)
%SQRTM Matrix square root.
% X = SQRTM_2by2(A) is the principal square root of the matrix A, i.e. X*X = A.
%
% X is the unique square root for which ev
www.eeworm.com/read/266126/11239048
cpp main2-2.cpp
// main2-2.cpp 检验bo2-2.cpp的主程序(与main2-1.cpp很像)
#include"c1.h"
typedef int ElemType;
#include"c2-2.h" // 与main2-1.cpp不同
#include"bo2-2.cpp" // 与main2-1.cpp不同
Status comp(ElemType c1,ElemTy
www.eeworm.com/read/266126/11239071
cpp algo2-2.cpp
// algo2-2.cpp 实现算法2.2的程序
#include"c1.h"
typedef int ElemType;
#include"c2-2.h"
#include"bo2-2.cpp"
void MergeList(SqList La,SqList Lb,SqList &Lc) // 算法2.2
{ // 已知线性表La和Lb中的数据元素按值非递减排列。
www.eeworm.com/read/266126/11239112
exe algo2-2.exe
www.eeworm.com/read/266126/11239148
cpp bo2-2.cpp
// bo2-2.cpp 单链表线性表(存储结构由c2-2.h定义)的基本操作(12个)
Status InitList(LinkList &L)
{ // 操作结果：构造一个空的线性表L
L=(LinkList)malloc(sizeof(LNode)); // 产生头结点,并使L指向此头结点
if(!L) // 存储分配失败
exit(OVERFLOW);
www.eeworm.com/read/266126/11239184
h c2-2.h
// c2-2.h 线性表的单链表存储结构
struct LNode
{
ElemType data;
LNode *next;
};
typedef LNode *LinkList; // 另一种定义LinkList的方法
www.eeworm.com/read/265910/11250314
cpp 15_2_2.cpp
//15_2_2
#include
class Animal;
void SetValue(Animal&, int);
void SetValue(Animal&, int, int);
class Animal{
public:
void Set(int v);
void Set(int v, int w);
protecte
www.eeworm.com/read/249826/12469150