Location:
Search - malloc.h
Search list
Description: #include \"stdio.h\"
#include \"malloc.h\"
#define TRUE 1
#define n 39
#define max 500
typedef struct
{
char p[n]
float w[n][n]
}graph
graph *ga2
int visit[n]
int path[n][n]
float C[n][n]
float A[n][n] -#include \"stdio.h\" #include \"malloc.h\" #define TRUE 1 #define n 39 #define max 500 typedef struct { char p[n] float w[n][n] }graph graph *ga2 int visit[n] int path[n][n] float C[n][n] float A[n][n]
Platform: |
Size: 4665 |
Author: jiangshan |
Hits:
Description: #include \"stdio.h\"
#include \"math.h\"
#include \"malloc.h\"
#include \"string.h\"
#define m 6
#define n 29
#define p 0.5-#include \"stdio.h\" #include \"math.h\" #include \"malloc.h\" #include \"string.h\" #define m 6 #define n 29 #define p 0.5
Platform: |
Size: 3091 |
Author: jiangshan |
Hits:
Description: #include \"stdio.h\"
#include \"math.h\"
#include \"malloc.h\"
#include \"string.h\"
#define m 6
#define n 29
#define p 0.5-#include \"stdio.h\" #include \"math.h\" #include \"malloc.h\" #include \"string.h\" #define m 6 #define n 29 #define p 0.5
Platform: |
Size: 109175 |
Author: jiangshan |
Hits:
Description: #include \"stdio.h\"
#include \"math.h\"
#include \"malloc.h\"
#include \"string.h\"
#define m 6
#define n 29
#define p 0.5-#include \"stdio.h\" #include \"math.h\" #include \"malloc.h\" #include \"string.h\" #define m 6 #define n 29 #define p 0.5
Platform: |
Size: 53805 |
Author: jiangshan |
Hits:
Description: #include \"stdio.h\"
#include \"math.h\"
#include \"malloc.h\"
#include \"string.h\"
#define m 6
#define n 29
#define p 0.5-#include \"stdio.h\" #include \"math.h\" #include \"malloc.h\" #include \"string.h\" #define m 6 #define n 29 #define p 0.5
Platform: |
Size: 764203 |
Author: jiangshan |
Hits:
Description: #include \"define.h\"
#include <stdio.h>
#include <string.h>
#include <ctype.h>
#include <malloc.h>
FILE *fp
/*//////////////////////////////////////////////////////////////////////////////
This is a pretreatment.
/////////////////////////////////////////////////////////////////////////////*/
void readIntoBuffer(char buffer[256])
{
char ch1
char temp
int i
for(i=0 i<256&&!feof(fp) i++)
{
ch1=fgetc(fp)
if(ch1== )-# include "define.h" # include
Platform: |
Size: 2335 |
Author: dddddddd |
Hits:
Description: #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <malloc.h>
#include <math.h>
#include <conio.h>
struct DuLNode{
struct DuLNode *prior
int data
struct DuLNode *next-# include
Platform: |
Size: 2998 |
Author: 黄宇 |
Hits:
Description: 实习题
[问题描述]
1. 设顺序表中的数据元素递增有序，将插入到顺序表的适当位置上，是该表仍然有序。
[输入]
初始顺序表，插入字符。
[输出]
插入x后线性表的结果
[存储结构]
采用顺序存储结构
[算法的基本思想]
建立一个递增顺序表，插入一个数值并移动元素，使其仍然有序。
程序如下：
#include \"iostream.h\"
#include <malloc.h>
#define LIST_INTI_SIZE 100//初始空间大小
typedef struct SqList
-attachment that [problem description] 1. Established order of the table data elements incremental orderly, will be inserted into the appropriate sequence table position is that the schedule remains orderly. [Imported] initial order and inserting characters. [Output] x inserted after the results of the linear scale [storage structure] sequence storage structure [algorithm for the basic idea : the establishment of a - incremental sequence table, insert a numerical and mobile elements, it remains orderly. The procedure is as follows : # include "iostream.h" # include
Platform: |
Size: 8550 |
Author: Demonic |
Hits:
Description: 1.[问题描述]
编写递归算法，计算二叉树中叶子结点的数目
[输入]
按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g .
[输出]
按中序序列输出，输出的结果为；dbheaficg并计算出二叉树中叶子结点的数目为4
[存储结构]
采用二叉表存储
[算法的基本思想]
采用递归方法建立和遍历二叉树。首先建立二叉树的根结点，然后建立其左右子树，直到空子树为止，中序遍历二叉树时，先遍厉左子树，后遍厉右子树，最后访问根结点。根据左右子树的最后一个结点计算出二叉树中叶子结点的数目。
程序如下：
#include<stdio.h>
#include<malloc.h>
#include\"stdlib.h\" -1. [Description of the issue] to prepare recursive algorithm, Binary calculation leaves the number of nodes [imported] in accordance with the first order input sequence in the order of the node contents. Input abd eh i g cf. [Output] by the order sequence output, the results of the output; dbheaficg calculated Binary leaf node to the number four [storage structure] Table 2 forks storage [ The basic idea algorithm] recursive method and traverse binary tree. First established binary tree root node, and then to build their son around the tree, the tree until the loopholes, which preorder binary tree, Li first times the left sub-tree, right after Li times-tree root node final visit. Under the sub-trees around the last one node calculated Binary leaf node number. The procedure is as follows : #
Platform: |
Size: 8133 |
Author: Demonic |
Hits:
Description: 2.[问题描述]
编写递归算法，在二叉树中求位于先序序列中第K个位置的结点
[输入]
按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g 。输入要求的位置
[输出]
若二叉树不空，按先序序列输出，求出所求位置的结点
[存储结构]
采用二叉表存储
[算法的基本思想]
采用递归方法建立和遍历二叉树。首先建立二叉树的根结点，然后建立其左右子树，直到空子树为止，先序遍历二叉树时，先遍厉左子树，后遍厉右子树，最后访问根结点并计算出二叉树中叶子结点的数目和第K个位置的结点
#include<stdio.h>
#include<malloc.h>
struct node{
char info
struct node*llink,*rlink
}
typedef struct node NODE
-2. [Description of the issue] to prepare recursive algorithm, Binary for the first sequence sequence in the first position of the K-node [imported] in accordance with the first order input sequence in the order of the nodes content. Input abd eh i g cf. Import requirements of the position [output] if the binary tree is not empty, the first sequence by sequence output obtained by seeking the location of nodes [storage structure] Table 2 forks storage [algorithm for the basic idea] recursive method and Traversing binary tree. First established binary tree root node, and then to build their son around the tree, the tree until the loopholes, preorder binary tree, Li first times the left sub-tree, after repeatedly Li-right tree Finally visit root node and calculated Binary leaf nodes and the nu
Platform: |
Size: 7096 |
Author: Demonic |
Hits:
Description: 此系统主要是演示数据结构中的单链表,仅供学习,交流之用,通过学习可以看到局部变量,全局变量,数据结构,算法的有机结合.在win-tc下可直接运行,在某些Troubc c下需要将malloc.h改为alloc.h
Platform: |
Size: 8081 |
Author: 杨业春 |
Hits:
Description: #include<malloc.h>
#include<limits.h>
#include<stdio.h>
#include<graphics.h>
#include<io.h>
#include<math.h>
#include<process.h>
#include<conio.h>
#define m 100
#define OK 1
typedef int Status
typedef char TElemType /*树元素的类型*/
int t=35
int n=20
int h=14
int u=2
int leaf=0,non_l_leaf=0,non_r_leaf=0,root=0 /*各种结点数*/
char le[m],l[m],r[m],ro[m] /*用与存放各种结点*/
typedef struct BiTNode/*定义二叉树*/
Platform: |
Size: 2243 |
Author: 全文 |
Hits:
Description: #include "stdio.h"
#include "malloc.h"
#define TRUE 1
#define n 39
#define max 500
typedef struct
{
char p[n]
float w[n][n]
}graph
graph *ga2
int visit[n]
int path[n][n]
float C[n][n]
float A[n][n] -#include "stdio.h"#include "malloc.h"#define TRUE 1#define n 39#define max 500 typedef struct { char p[n] float w[n][n] }graph graph*ga2 int visit[n] int path[n][n] float C[n][n] float A[n][n]
Platform: |
Size: 45056 |
Author: jiangshan |
Hits:
Description: #include "stdio.h"
#include "math.h"
#include "malloc.h"
#include "string.h"
#define m 6
#define n 29
#define p 0.5-#include "stdio.h"#include "math.h"#include "malloc.h"#include "string.h"#define m 6#define n 29#define p 0.5
Platform: |
Size: 108544 |
Author: jiangshan |
Hits:
Description: #include "stdio.h"
#include "math.h"
#include "malloc.h"
#include "string.h"
#define m 6
#define n 29
#define p 0.5-#include "stdio.h"#include "math.h"#include "malloc.h"#include "string.h"#define m 6#define n 29#define p 0.5
Platform: |
Size: 1679360 |
Author: jiangshan |
Hits:
Description: #include "define.h"
#include <stdio.h>
#include <string.h>
#include <ctype.h>
#include <malloc.h>
FILE *fp
/*//////////////////////////////////////////////////////////////////////////////
This is a pretreatment.
/////////////////////////////////////////////////////////////////////////////*/
void readIntoBuffer(char buffer[256])
{
char ch1
char temp
int i
for(i=0 i<256&&!feof(fp) i++)
{
ch1=fgetc(fp)
if(ch1== )-# include "define.h"# include
Platform: |
Size: 2048 |
Author: dddddddd |
Hits:
Description: #include<malloc.h>
#include<limits.h>
#include<stdio.h>
#include<graphics.h>
#include<io.h>
#include<math.h>
#include<process.h>
#include<conio.h>
#define m 100
#define OK 1
typedef int Status
typedef char TElemType /*树元素的类型*/
int t=35
int n=20
int h=14
int u=2
int leaf=0,non_l_leaf=0,non_r_leaf=0,root=0 /*各种结点数*/
char le[m],l[m],r[m],ro[m] /*用与存放各种结点*/
typedef struct BiTNode/*定义二叉树*/-# Include
Platform: |
Size: 2048 |
Author: 全文 |
Hits:
Description: 针对由系统调用sbrk()申请得到的内存区域进行管理，实现了用户中申请、释放内存过程。整个程序由头文件malloc.h、分配与释放模块malloc.c、应用程序test.c和工程文件makefile共四个文件组成，该程序已在linux下成功调试通过-include <unistd.h>
#include "my_malloc.h"
static Header base /* empty list to get started*/
static Header*free_list = NULL /* start of free list*/
/* Malloc: general-purpose storage allocator*/
void*
Malloc(unsigned int nbytes)
{
Header*p,*prev
unsigned int nunits
nunits = (nbytes+ sizeof(Header)- 1)/sizeof(Header)+ 1
if ( (prev = free_list) == NULL) { /* no free list yet*/
Platform: |
Size: 9216 |
Author: jjl |
Hits:
Description: malloc.h - NTFS kernel memory handling. Part of the Linux-NTFS project.
Platform: |
Size: 3072 |
Author: zktonxs |
Hits:
Description: #include stdio,h #include malloc,h #define TRUE 1 #define n,(# include the stdio, h # include malloc, 1 # define n h # define TRUE,)
Platform: |
Size: 3072 |
Author: 朱龙云
|
Hits: