Skip to main content

Create PHP Array in PHP Programming

Create PHP array :-
                               We have following methods to create an array in PHP.
To assign index and key manually to the variable: - In this method we have to provide a specific index value as well as key value to the variable. This can be understood with the help of example.
Let we want an array named “record” to store different information of students such as name, age , id, and marks. Here the variable “record” act as an array and store all these information in following way.

In this example we use an array variable $record to store different elements. Now we have following properties this PHP array.
Index range for this array is 0-3.where minimum index is 0 and maximum index is 3;
Maximum item that this array can store is 4.
A PHP array can store different type of elements like integer or string or double etc. because php takes the type of data automatically corresponding to that.
In above program we use the function print_r() which is used to print values store in array variable.






In this example we used a key in stand of index. PHP provide this facility to make the array calculation much easy and user-friendly. The array which uses keys to hold the value is called associative array. 
To use range() function:- If we want to create an array  with a specific range like for integer such as 100-500 or for float 4.6-90.6 or for string like b-k then we can create an array by using range function. Syntax of this method is following
Range (string value, ending value, difference);
This could be understood with the help of example.









To use array () function: - This functions is used to make an array in php. The syntax of this fictional is follows.
Array array ([ mixed $... ] )
This array function takes mixed type of variables and prepares an array for us.
This can be understand with the help of following codes.
$name=array(“jack”, “jon”,”weilems”);
Or this can be use for associative array such as:-
$record=array(name->”jack” ,roll->5, marks->45.9, address->”new york”);

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 …