搜索结果
找到约 44 项符合
MALLOC 的查询结果
按分类筛选
源码 c语言算法排序
1．Describe a Θ(n lg n)-time algorithm that, given a set S of n integers and
another integer x, determines whether or not there exist two elements in S whose sum is exactly x. (Implement exercise 2.3-7.)
#include<stdio.h>
#include<stdlib.h>
void merge(int arr[],int low,int mid,int high){
&nbsp; ...
源码 数据结构实验
#include&nbsp;<stdio.h>&nbsp;&nbsp;
#include&nbsp;<stdlib.h>&nbsp;///链式栈&nbsp;&nbsp;
&nbsp;&nbsp;
typedef&nbsp;struct&nbsp;node&nbsp;&nbsp;
{&nbsp;&nbsp;
&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;data;&nbsp;&nbsp;
&nbsp;&nbsp;&nbsp;&nbsp;struc ...
源码 数据结构实验
#include <iostream>
#include <stdio.head>
#include <stdlib.head>
#include <string.head>
#define ElemType int
#define max 100
using namespace std;
typedef struct node1
{
ElemType data;
struct node1 *next;
}Node1,*LinkList;//链栈
typedef struct
{
ElemType *base;
int top;
}SqStack;// ...
源码 数组子系统
#include <stdio.h>
#include <stdlib.h>
#define SMAX 100
typedef struct SPNode
{
int i,j,v;
}SPNode;
struct sparmatrix
{
int rows,cols,terms;
SPNode data [SMAX];
};
sparmatrix CreateSparmatrix()
{
sparmatrix A;
printf("\n\t\t请输入稀疏矩阵的行数，列数和非零元素个数（用逗号隔开）:");
scanf("%d, ...