C/C++ Examples and Source Codes

Tutorial on Pointers and Arrays in C (pdf)

admin — Mon, 27 Jul 2009 23:11:37 +0000

This document is intended to introduce pointers to beginning programmers in the C programming language. Over several years of reading and contributing to various conferences on C including those on the FidoNet and UseNet, I have noted a large number of newcomers to C appear to have a difficult time in grasping the fundamentals of pointers. I therefore undertook the task of trying to explain them in plain language with lots of examples.
DOWNLOAD

Linked List Example in C

admin — Mon, 27 Jul 2009 22:57:25 +0000

Each record of a linked list is often called an element or node. The field of each node that contains address of the next node is usually called the next link or next pointer. The remaining fields may be called the data, information, value, or payload fields.

The head of a list is its first node, and the tail is the list minus that node (or a pointer thereto). In Lisp and some derived languages, the tail may be called the CDR (pronounced could-R) of the list, while the payload of the head node may be called the CAR.
Many programming languages such as Lisp and Scheme have singly linked lists built in. In many functional languages, these lists are constructed from nodes, each called a cons or cons cell. The cons has two fields: the car, a reference to the data for that node, and the cdr, a reference to the next node. Although cons cells can be used to build other data structures, this is their primary purpose.
In languages that support Abstract data types or templates, linked list ADTs or templates are available for building linked lists. In other languages, linked lists are typically built using references together with records. Here is a complete example in C:

#include /* for printf */
#include /* for malloc */

typedef struct node {
int data;
struct node *next; /* pointer to next element in list */
} LLIST;

LLIST *list_add(LLIST **p, int i);
void list_remove(LLIST **p);
LLIST **list_search(LLIST **n, int i);
void list_print(LLIST *n);

LLIST *list_add(LLIST **p, int i)
{
LLIST *n = (LLIST *) malloc(sizeof(LLIST));
if (n == NULL)
return NULL;

n->next = *p; /* the previous element (*p) now becomes the “next” element */
*p = n; /* add new empty element to the front (head) of the list */
n->data = i;

return *p;
}

void list_remove(LLIST **p) /* remove head */
{
if (*p != NULL)
{
LLIST *n = *p;
*p = (*p)->next;
free(n);
}
}

LLIST **list_search(LLIST **n, int i)
{
while (*n != NULL)
{
if ((*n)->data == i)
{
return n;
}
n = &(*n)->next;
}
return NULL;
}

void list_print(LLIST *n)
{
if (n == NULL)
{
printf(”list is empty\n”);
}
while (n != NULL)
{
printf(”print %p %p %d\n”, n, n->next, n->data);
n = n->next;
}
}

int main(void)
{
LLIST *n = NULL;

list_add(&n, 0); /* list: 0 */
list_add(&n, 1); /* list: 1 0 */
list_add(&n, 2); /* list: 2 1 0 */
list_add(&n, 3); /* list: 3 2 1 0 */
list_add(&n, 4); /* list: 4 3 2 1 0 */
list_print(n);
list_remove(&n); /* remove first (4) */
list_remove(&n->next); /* remove new second (2) */
list_remove(list_search(&n, 1)); /* remove cell containing 1 (first) */
list_remove(&n->next); /* remove second to last node (0) */
list_remove(&n); /* remove last (3) */
list_print(n);

return 0;
}

Use Basic C++, Syntax and Operators(pdf)

admin — Mon, 27 Jul 2009 22:40:44 +0000

In this How to we summarize the basic syntax of C++ and the rules and operators that are used in C++ expressions. This is a brief language reference for C++ as used in this book, not the entire language. We don’t cover the use of dynamic memory in this How to.

DOWNLOAD

C Array Fun

admin — Fri, 08 May 2009 17:45:12 +0000

Array Fun allows you to do the following operations on an array: Read file; print array; print stats (average, range, mode, median); add to the file (multiple nums); delete from file (one num); sorting (bubble sort / replacement sort / insertion sort / quick sort); find a number using binary search.

Download

Sort C Array Using Recursion

admin — Fri, 08 May 2009 17:41:36 +0000

This code sorts an array using recursion.

Download

String C Array Length

admin — Fri, 08 May 2009 17:38:48 +0000

This pretty simple, where message and message2 are in the main function you can enter a c string and the function StringLength will tell you how many characters are in the string. You can create many varitions with this snippet.

Download

Recording using C pointers

admin — Fri, 08 May 2009 17:33:21 +0000

Records a number using a pointer.

Download

C++ Pointer Example

admin — Fri, 08 May 2009 17:31:31 +0000

This code shows how to use pointers in a c simple example that adds people to the text file , deletes them or retrieves them.

Download

Master C String Download

admin — Sat, 02 May 2009 02:57:00 +0000

Master String is a collection of functions, and classes that will aid you in very explicit string manipulation.

Download from: Homepage

C Array Sorting Download

admin — Wed, 22 Apr 2009 02:54:00 +0000

This package contains a sort header file with four types of sorts: bubble, insertion, quick and selection. The header also uses templates so that you can implement the sorle, insertion, quick and selection. The header also uses templates so that you can implement the sorting of several types.

Download from: Homepage