Hello folks! welcome back to a new edition of our tutorial on PHP. In this tutorial guide, we are going to be studying about the PHP Ds Deque sorted() Function.
The built-in Ds Deque sorted() function in PHP returns a sorted copy of the deque by using an optional comparator function.
The built-in Ds Deque sorted() function in PHP returns a sorted copy of the deque by using an optional comparator function.
Syntax
Following below is the syntax to use this function -
public Ds\Deque Ds\Deque::sorted([ callable $comparator ] )
Return Value
This PHP function returns the sorted copy of the deque.
Example1
Try out the below example -
<?php deque = new \Ds\Deque([4, 7, 2, 9, 5, 1, 6]); echo("The elements in deque: \n"); print_r($deque); echo("The sorted deque: \n"); print_r($deque->sorted()); ?>
Example2
Try the following example -
<?php $deque = new \Ds\Deque([4, 7, 2, 9, 5, 1, 6]); echo("The elements in deque: \n"); print_r($deque); $deque = $deque->sorted(function($var1, $var2) { return $var1 <= $var2; }); echo("The sorted deque: \n"); print_r($deque); ?>
Alright guys! This is where we are going to be rounding up for this tutorial post. In our next tutorial, we are going to be discussing about the PHP Ds Deque sum() Function.
Do feel free to ask your questions where necessary and we will attend to them as soon as possible. If this tutorial was helpful to you, you can use the share button to share this tutorial.
Follow us on our various social media platforms to stay updated with our latest tutorials. You can also subscribe to our newsletter in order to get our tutorials delivered directly to your emails.
Thanks for reading and bye for now.
Do feel free to ask your questions where necessary and we will attend to them as soon as possible. If this tutorial was helpful to you, you can use the share button to share this tutorial.
Follow us on our various social media platforms to stay updated with our latest tutorials. You can also subscribe to our newsletter in order to get our tutorials delivered directly to your emails.
Thanks for reading and bye for now.