Found 27759 Articles for Server Side Programming

The array_reduce() function returns an array as a string, using a user-defined function.Syntaxarray_reduce(arr, custom_func, initial)Parametersarr − The array. Required.custom_func − The name of the user-defined function. Required.initial − Initial value to be sent to the function. Optional.ReturnThe array_reduce() function returns the resulting value. It returns NULL, if the array is an empty array and initial isn’t passed.ExampleThe following is an example − Live DemoOutputThe following is the output −2 DEMO One DEMO TwoExampleLet us see another example wherein the given array is reduced o the product of all the elements of the array − Live DemoOutputThe following is the output −1250Read More

The array_push() function inserts one or more elements to the end of an array. It returns the new elements pushed into the array.Syntaxarray_push(arr, val1, val2)Parametersarr − The specified arrayval1 − The value to be pushedval2 − The value to be pushedReturnThe array_push() function returns the new elements pushed into the array.ExampleThe following is an example − Live DemoOutputThe following is the output −Array ( [0] => table [1] => chair [2] => pen [3] => pencil [4] => notepad [5] => paperclip )

The array_pop() function deletes the last element of an array. It returns the value of the last element of the array. If the array is empty, NULL is returned.Syntaxarray_pop(arr)Parametersarr − The specified arrayReturnThe array_pop() function returns the last element of the array. If the array is empty, NULL is returned.The following is an example −Example Live DemoOutputThe following is the output −tablet

The atan2() function returns the tangent inverse of the coordinate in terms of y and x. Here y and x are the values of the y and x coordinates respectively. It is an inbuilt function in C++ STL.The syntax of the atan2() function is given as follows.atan2(dataType var1, dataType var2)As can be seen from the syntax, the function atan2() accepts two parameters var1 and var2 of data type float, double or long double that are y and x point respectively.The value returned by atan2() is in the range of -pi to pi and is the angle between the (x, y) ... Read More

The acos() function returns the inverse cosine of an angle given in radians. It is an inbuilt function in C++ STL.The syntax of the acos() function is given as follows.acos(var)As can be seen from the syntax, the function acos() accepts a parameter var of data type float, double or long double. The value of this parameter should be between -1 and 1. It returns the inverse cosine of var in the range of -pi to pi.A program that demonstrates acos() in C++ is given as follows.Example Live Demo#include #include using namespace std; int main() {    double d = ... Read More

A stack is an abstract data structure that contains a collection of elements. Stack implements the LIFO mechanism i.e. the element that is pushed at the end is popped out first. Some of the principle operations in the stack are −Push - This adds a data value to the top of the stack.Pop - This removes the data value on top of the stack.Peek - This returns the top data value of the stack.A program that implements a stack using linked list is given as follows.Example#include using namespace std; struct Node {    int data;    struct Node *next; ... Read More

A stack is an abstract data structure that contains a collection of elements. Stack implements the LIFO mechanism i.e. the element that is pushed at the end is popped out first. Some of the principle operations in the stack are −Push - This adds a data value to the top of the stack.Pop - This removes the data value on top of the stackPeek - This returns the top data value of the stackA program that implements a stack using array is given as follows.Example#include using namespace std; int stack[100], n=100, top=-1; void push(int val) {    if(top>=n-1)   ... Read More

Doubly linked list is a type of data structure that is made up of nodes that are created using self referential structures. Each of these nodes contain three parts, namely the data and the reference to the next list node and the reference to the previous list node.Only the reference to the first list node is required to access the whole linked list. This is known as the head. The last node in the list points to nothing so it stores NULL in that part. Also the doubly linked list can be traversed in both directions as each node points ... Read More

Circular singly linked list is a type of data structure that is made up of nodes that are created using self referential structures. Each of these nodes contain two parts, namely the data and the reference to the next list node.Only the reference to the first list node is required to access the whole linked list. This is known as the head. The last node in the list points to head or first node of the list. That is the reason this is known as a circular linked list.A program to implement circular singly linked list is given as follows.Example Live ... Read More

Singly linked list is a type of data structure that is made up of nodes that are created using self referential structures. Each of these nodes contain two parts, namely the data and the reference to the next list node. Only the reference to the first list node is required to access the whole linked list. This is known as the head. The last node in the list points to nothing so it stores NULL in that part.A program to implement singly linked list is given as follows.Example Live Demo#include using namespace std; struct Node {    int data;   ... Read More