Skip to main content

How to Perform Array Initialization in C language

After declaration of arrays, the process of initialization starts in computer programming. Array initialization in C may be perform in many ways will be discuss in this article. C programming provides to let the programmer initialize the array to specific values when it is declared, when it is required or etc. Each option have its own examples described in the article.

How to Perform Array Initialization in Computer Programming: C

Initialization of all specified locations

Arrays can be initialized at the same time of declaration when their initial values are known in advance. Array elements can be initialized with data items of type int, char, float, etc.

int arr[5] = {15, 45, 85, 96, 69};

During compilation, 5 contiguous memory locations are reserved by the compiler for the array arr and all these locations are initialized as shown below:

How to Perform Array Initialization in Computer Programming: C

If the size of an integer is 2 bytes, 10 bytes will be allocated for the array arr. Lets discuss another initialization

int arr[5] = {15, 58, 98, 89, 65, 54, 55, 25, 85};
This declaration will notify an error with a message Number of initial values are more than the size of the array arr

char str[7] = {'P', 'R', 'O', 'G', 'R', 'A', 'M'};

During compilation, 7 contiguous memory locations are reserved by the compiler for the variable str and all these locations are initialized as shown below:

How to Perform Array Initialization in Computer Programming: C

In fact in place of character, ASCII values are stores in the memory. Since a character occupies 1 byte, 8 bytes will be allocated for the variable str.

Partial Array Initialization

C language also provides partial array initialization. If the number of values to be initialized is less than the size of an array, then the elements are initialized in order from 0th location. The remaining locations will be initialized to zero automatically. For example, consider the partial initialization shown below:

int arr[5] = {56, 76, 98};

Even though compiler allocates 5 memory locations, using this declaration statement, the compiler initialized first three locations with 56, 76 and 98. The next set of memory location are automatically initialized to 0's by the compiler as shown below:

How to Perform Array Initialization in Computer Programming: C

Initialization without Size

Consider the declaration along with initialization shown below:
char str[] = {'P', 'R', 'O', 'G', 'R', 'A', 'M'};

In this declaration, even though we have not specified exact number of elements to be used in array str, the array size will be set to the total number of initial values specified. So, the array size will be set to 7 automatically. The array str is initialized as shown below:

How to Perform Array Initialization in Computer Programming: C

String Initialization

Consider the declaration with string initialization:

char str[] = "PROGRAM";

The array str is initialized as shown below:

How to Perform Array Initialization in Computer Programming: C

Even though the string "PROGRAM" contains 7 characters, because it is a string, it always ends with NULL character '\0'. So, the array size is 8 bytes i.e. string length + 1 byte for NULL character.

char str[8] = "PROGRAM"; is Correct, size of the array is string length + 1 byte for NULL character.
char str[7] = "PROGRAM";  is Wrong, size of the array should be minimum 8.

For string initialization, usually the programmer prefer the following declaration:
char str[] = "PROGRAM";

Reading and Writing Single Dimensional Array

Comments

Popular posts from this blog

difference between structure and union in C Language

In c language article we will see the difference between union and structure. Both are the user define datatype in c language. See the table which is mentioned below: ASP.NET Video Tutorial Series Structure Union1.The keywordstruct is used to define a structure 1. The keyword union is used to define a union. 2. When a variable is associated with a structure, the compiler allocates the memory for each member. The size of structure is greater than or equal to the sum ofsizes of its members. The smaller members may end with unused slack bytes. 2. When a variable is associated with a union, thecompiler allocates thememory by considering the size of the largest memory. So, size of union is equal to the size of largest member. 3. Each member within a structure is assigned unique storage area of location. 3. Memory allocated is shared by individual members of union. 4. The address of each member will be in ascending order This indicates that memory for each member will start at different offset v…

Difference between Linear search and Binary Search in c language

SQL Video Channel : Download all SQL Video



Binary Search Linear Search Works only on sorted items. such as  1,2,3,4,5,6  etc
Works on sorted as well as unsorted items. 12,4,5,3,2,1 etc Very efficient if the items are sorted Very efficient if the items are less and present in the beginning of the list. such as Suppose your list items are : 12,3,4,5,1 and you want to search 12 number then you get beginning in the list. Works well with arrays and not on linked lists. Works with arrays and linked lists.
Number of comparisons are less More number of comparisons are required if the items are present in the later part of the array or its elements are more.

Memory representation of Linked List Data Structures in C Language

Memory representation of Linked List

             In memory the linked list is stored in scattered cells (locations).The memory for each node is allocated dynamically means as and when required. So the Linked List can increase as per the user wish and the size is not fixed, it can vary.

               Suppose first node of linked list is allocated with an address 1008. Its graphical representation looks like the figure shown below:


      Suppose next node is allocated at an address 506, so the list becomes,



  Suppose next node is allocated with an address with an address 10,s the list become,


The other way to represent the linked list is as shown below:




 In the above representation the data stored in the linked list is “INDIA”, the information part of each node contains one character. The external pointer root points to first node’s address 1005. The link part of the node containing information I contains 1007, the address of next node. The last node …