Misc/abrash-black-book
Watch
1
0
Fork
You've already forked abrash-black-book
 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Change HTML4 entities to HTML5

Browse source 
&lt to <
&gt to >
&amp to &
This commit is contained in:
James Gregory 2013-12-30 14:33:39 +11:00
commit b8e7ce7165
105 changed files with 1117 additions and 1117 deletions
Download patch file Download diff file Expand all files Collapse all files

30
59-05.html
View file

@ -53,10 +53,10 @@
// Sample program to exercise and time the performance of
// implementations of WalkTree().
// Tested with 32-bit Visual C++ 1.10 under Windows NT.
#include &ltstdio.h&gt
#include &ltconio.h&gt
#include &ltstdlib.h&gt
#include &lttime.h&gt
#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
#include <time.h>
#include “tree.h”
long VisitCount = 0;
void main(void);
@ -68,12 +68,12 @@ void main()
int i;
long StartTime;
// Build a sample tree
BuildTree(&ampRootNode, 14);
BuildTree(&RootNode, 14);
// Walk the tree 1000 times and see how long it takes
StartTime = time(NULL);
for (i=0; i&lt1000; i++)
for (i=0; i<1000; i++)
{
WalkTree(&ampRootNode);
WalkTree(&RootNode);
}
printf(“Seconds elapsed: %ld\n”,
time(NULL) - StartTime);
@ -87,25 +87,25 @@ void BuildTree(NODE *pNode, int RemainingDepth)
{
if (RemainingDepth == 0)
{
pNode-&gtpLeftChild = NULL;
pNode-&gtpRightChild = NULL;
pNode->pLeftChild = NULL;
pNode->pRightChild = NULL;
}
else
{
pNode-&gtpLeftChild = malloc(sizeof(NODE));
if (pNode-&gtpLeftChild == NULL)
pNode->pLeftChild = malloc(sizeof(NODE));
if (pNode->pLeftChild == NULL)
{
printf(“Out of memory\n”);
exit(1);
}
pNode-&gtpRightChild = malloc(sizeof(NODE));
if (pNode-&gtpRightChild == NULL)
pNode->pRightChild = malloc(sizeof(NODE));
if (pNode->pRightChild == NULL)
{
printf(“Out of memory\n”);
exit(1);
}
BuildTree(pNode-&gtpLeftChild, RemainingDepth - 1);
BuildTree(pNode-&gtpRightChild, RemainingDepth - 1);
BuildTree(pNode->pLeftChild, RemainingDepth - 1);
BuildTree(pNode->pRightChild, RemainingDepth - 1);
}
}
//