This builtin function of PHP is used to compute the intersection of two or more arrays. The function is used to compare the values of two or more arrays and returns the matches. The function prints only those elements of the first array that are present in all other arrays.
array array_intersect($array1, $array2, $array3, $array4...)
Parameters: The array_intersect() function takes at least two arrays as arguments. It can take any number of arrays greater than or equal to two separated by commas (‘,’).
Return Type: The function returns another array containing the elements of the first array that are present in all other arrays passed as the parameter. If no element matches then, a NULL array is returned.
Note: The keys of elements are preserved. That is, the keys of elements in output array will be same as that of keys of those elements in the first array.
Input : $array1 = array(5, 10, 15, 20, 25, 30) $array2 = array(20, 10, 15, 55, 110, 30) $array3 = array(10, 15, 30, 55, 100, 95) Output : Array (  => 10  => 15  => 30 ) Input : $array1 = array("ram", "laxman", "rishi", "ayush"); $array2 = array("ayush", "gaurav", "rishi", "rohan"); $array3 = array("rishi", "gaurav", "ayush", "ravi"); Output : Array (  => rishi  => ayush )
Below program illustrates the array_intersect() function in PHP:
Array (  => 10  => 15  => 30 )
- How to get the function name inside a function in PHP ?
- D3.js | d3.hcl() Function
- p5.js | nf() Function
- p5.js | nfc() function
- CSS | rgb() Function
- p5.js | pow() function
- D3.js | d3.rgb() Function
- p5.js | day() function
- CSS | url() Function
- D3.js | d3.lab() Function
- D3.js | d3.map.set() Function
- p5.js | sq() function
- PHP | ord() Function
- PHP | pow( ) Function
- p5.js | nfp() Function
- p5.js | nfs() Function
- p5.js | abs() function
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.