PHP Searching and Sorting Algorithm: Radix sort
PHP Searching and Sorting Algorithm: Exercise-12 with Solution
Write a PHP program to sort a list of elements using Radix sort.
Sample Solution :
PHP Code :
<?php
function radix_sort($elements) {
// Array for 10 queues.
$queues = array(
array(), array(), array(), array(), array(), array(), array(), array(),
array(), array()
);
// Queues are allocated dynamically. In first iteration longest digits
// element also determined.
$longest = 0;
foreach ($elements as $el) {
if ($el > $longest) {
$longest = $el;
}
array_push($queues[$el % 10], $el);
}
// Queues are dequeued back into original elements.
$i = 0;
foreach ($queues as $key => $q) {
while (!empty($queues[$key])) {
$elements[$i++] = array_shift($queues[$key]);
}
}
// Remaining iterations are determined based on longest digits element.
$it = strlen($longest) - 1;
$d = 10;
while ($it--) {
foreach ($elements as $el) {
array_push($queues[floor($el/$d) % 10], $el);
}
$i = 0;
foreach ($queues as $key => $q) {
while (!empty($queues[$key])) {
$elements[$i++] = array_shift($queues[$key]);
}
}
$d *= 10;
}
}
// Example usage:
$a = array(170, 45, 75, 90, 802, 24, 2, 66);
print_r($a);
radix_sort($a);
print_r($a);
?>
Sample Output:
Array ( [0] => 170 [1] => 45 [2] => 75 [3] => 90 [4] => 802 [5] => 24 [6] => 2 [7] => 66 ) Array ( [0] => 170 [1] => 45 [2] => 75 [3] => 90 [4] => 802 [5] => 24 [6] => 2 [7] => 66 )
Flowchart :
PHP Code Editor:
Have another way to solve this solution? Contribute your code (and comments) through Disqus.
Previous: Write a PHP program to sort a list of elements using Counting sort.
Next: Write a PHP program to sort a list of elements using Bead sort.
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.
PHP: Tips of the Day
How to Sort Multi-dimensional Array by Value?
Try a usort, If you are still on PHP 5.2 or earlier, you'll have to define a sorting function first:
Example:
function sortByOrder($a, $b) { return $a['order'] - $b['order']; } usort($myArray, 'sortByOrder');
Starting in PHP 5.3, you can use an anonymous function:
usort($myArray, function($a, $b) { return $a['order'] - $b['order']; });
And finally with PHP 7 you can use the spaceship operator:
usort($myArray, function($a, $b) { return $a['order'] <=> $b['order']; });
To extend this to multi-dimensional sorting, reference the second/third sorting elements if the first is zero - best explained below. You can also use this for sorting on sub-elements.
usort($myArray, function($a, $b) { $retval = $a['order'] <=> $b['order']; if ($retval == 0) { $retval = $a['suborder'] <=> $b['suborder']; if ($retval == 0) { $retval = $a['details']['subsuborder'] <=> $b['details']['subsuborder']; } } return $retval; });
If you need to retain key associations, use uasort() - see comparison of array sorting functions in the manual
Ref : https://bit.ly/3i77vCC
- New Content published on w3resource:
- HTML-CSS Practical: Exercises, Practice, Solution
- Java Regular Expression: Exercises, Practice, Solution
- Scala Programming Exercises, Practice, Solution
- Python Itertools exercises
- Python Numpy exercises
- Python GeoPy Package exercises
- Python Pandas exercises
- Python nltk exercises
- Python BeautifulSoup exercises
- Form Template
- Composer - PHP Package Manager
- PHPUnit - PHP Testing
- Laravel - PHP Framework
- Angular - JavaScript Framework
- Vue - JavaScript Framework
- Jest - JavaScript Testing Framework