Skip to main content

Array Classification in C Language with Declaration

Array in computer programming is used to store data items in a list, that may of any type. The array can be classified based on how the data items are arranged for human understanding. We have discussed about the concept of array, in this article we will classify an array.

The following figure shows the classification of the array:

Single dimensional arrays

A single dimensional array (also called one dimensional array) is a linear list consisting of related and similar data items. In memory, all the data items are stored in contiguous memory locations one after the other. Pictorial representation of single dimensional array is shown below:

Here, all the items are arranged in a row. It is called 'row major' arrangement. Instead, they can also be arranged column wise. It is called 'column major' arrangement. The memory requirement for the array depends on the type of data items stored and number of items. Let us assume, data items are of type int and assume that int takes 2 bytes (in majority of PCs size of integer will be 4 or 8 bytes). Since 5 elements are stored and the size of int is 2 bytes, the memory required for the array is 10 bytes. If the size of integer is 4 bytes, the array uses 40 bytes of memory and so on in general

Memory for array – n * sizeof (data type)


  •  is the number of data items
  • data type  the data type of data items

An array has the following basic properties:

  • The data items (called elements) stored in the array should be of the same data type. The data items are stored contiguously in memory with subscript of the first item always 0 (zero).
  • Each data item is accessed using the same name long with different subscript.
  • The subscript or index of the array is always an integer.

Declaration of single dimensional arrays:

We know that all the variables are declared before they are used in the program. Similarly, an array must be declared before it is used. During declaration, the size of the array has to specify. The size used during declaration of the array informs the compiler to allocate and reserve the specified memory locations. A single dimensional array in C can be declared using the following syntax:



  • data_type – can be a basic data type such as int, float, char, etc.
  • array_name – is the name of the array
  • expression – should be evaluated to a positive integer only. It can also be an integer constant. The expression should be enclosed within square brackets ‘[]’.

Note: Expression such as 10 or 10+2 is allowed. No variables are allowed in expression, for example, 10+b is not allowed because b is a variable.

For example, consider the following declaration statement: int arr[10];
The compiler reserves 10 locations (i.e. 2 *10 bytes) for the array arr. In each of the location we can store an integer value. The memory allocated by the compiler is, pictorially represented as:


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 …