This program utilizes the C language to demonstrate the basic usage of how to read a binary tree.
The three mentioned in this code are pre, post, and in order traversals.
-pre order traversal
go to left subtree, and do pre-order tr
The below code is used to demonstrate the use of a bubble sort in the C language.
int count = 0;
void sort(int , int, int);
void bubbleSort(int , int, int);
int array = cfw_5,6,9,2,45,16,8,10,198,1581,1,41,5,15,
The below code is used to demonstrate how to create children processes from a parent process
using the fork function in C.
991 279 023
int sum = 0;
pid_t child1, child2;
The code found below this paragraph demonstrates the use of insertion sort using the C language.
#define MAX 7
int testdata[MAX] = cfw_1982,183,182,29,1782,2
This code is used to test whether or not the function prototypes defined in ADTList.h are
properly assigned functionality in ADTList.c. This code simply checks that the code does what
its supposed to do.
This program displays how to assign pre-determined functions functionality. The accompanying
code segment is found the file, C Program ADTList.h. To actually test this program, refer to C
Program Linked List Testing
991 279 023
The below code is used to demonstrate how to use the math.h library in C. The program utilizes
the library to determine whether an x and y coordinate is inside of the circle, given a
predetermined radius, and circle x and y.
The below code is a C program that retrieves data from a file pertaining to patient entries, this
program uses the quicksort algorithm to sort the patients by either their time of arrival or priority
/* I, Angelo Romualdo, have written the code. I
Heres a very basic tutorial on pointers.
In programming, variables have data, however that data must exist somewhere. A pointer is a
Hexadecimal representation of a variable or data structures memory address.
To retrieve an address from a data type/struct