Yearly Archives | 2014

Programming C: Posts 11 – Pointers in c

Using pointers in c allows us to manage memory, avoid wasting excess or deficiency. Today's article I will guide you how to use pointers how.

Programming C: Posts 13 – Type of structure – struct

For arrays, can save a lot of information has the same data type. But with this type of structure we can store information more different data types.

Programming C: Posts 12 – The relationship between pointers and arrays, string

Arrays and pointers positive relationship signed intimately. This article will help you understand somewhat the relationship.

Programming C: Posts 9 – Arrays in C

A set of array elements with the same type of data. Array of arrays 1 evening, 2 evening,... And each type of data, there 1 corresponding array (integer array, real array, character array (Chain)),... I mainly consider the array 1 dimensional array 2 evening

Programming C: Posts 10 – String in c

In all Import Export in c we've become familiar with how to declare, entry and string in C simply. In this article we will talk more about the examples, homework chain .

Programming C: Posts 12 – List of links set in array

List of links can be installed in arrays or pointers. In this article I will show you how to use arrays :), Type this list is often called the next list.

Programming C: Posts 13 – List installed applications associated with the cursor

List of links can be installed in arrays or pointers. In this article I will show you how to use arrays :), Type this list referred to as single-linked list

Programming C: Posts 14 – Doubly linked list

Doubly linked list is a linked list format, but each element associated with the element preceding and following it in the list…

Programming C: Posts 15 – Install stack (Stack)

Stacks (Stack) is an unordered list that allows insertion and deletion is performed at the end of the list and we call this the tip end (top) the stack…

Programming C: Posts 16 – Construction queue (Queue)

Queues (Queue) is a data structure used to store objects work under the FIFO (acronym in English: First In First Out), mean “in first-out” In the queue, Objects can be added to the line…