Skip to main content

Insert element in Array in PHP Programming

Insert element in PHP array:- 
                                                                             If we wish to insert a new item or element in PHP array then we have three choices first is insert the element  from fist position , second is insert the element  at last position and third is insert the element at any desire position in an array. Here following code is showing that how to implement above three operations.



Insert the element from starting of array: - We can do this we use PHP array_unshift() function. Syntax of this function is follows:-
              Int  array_unshift(array array, mixed variable [, mixed variable...])

So we can use any element to the array which is passed in this function  this can be understand with the help of following code.
:
$names = array("jack”,“jon");
array_unshift($states,"weilems","reacher");
after this statement the array name  becomes
$names = array("jon","jacob","rhett","weilems");

So names jack and jon added to the $names array from its starting index and value of index replace by 2 because two new element we added. The same function can be applied with associative array but the key name does not changed.


Insert the element  at last position:- This can be possible in PHP array by using array_push() method. The syntax of this array is
int array_push(array array, mixed variable [, mixed variable...])
So the element is added to the given array and return true if success and return false if failed. This can be understood with the help of following code.

$names = array("weilems"," reacher");
array_push($states," jon "," jack ");
after this statement the array name  becomes
$names = array("jon","jacob","rhett","weilems");

So names weilems and reacher added to the $names array from its end index and value of index increased by 2 because two new element we added. The same function can be applied with associative array.


Insert the element at any desire position:- This is possible if we have sufficient index is available. This can be possible by using direct assignment for example if we want to add a value at fourth index of $name array the we use following statements.

$name [4] =” weilems”;

If the 4th index is available and free then name “weilems” will be add to this index. Or it replaces the value which is already stored at this index.

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 …