PHP Searching and Sorting Algorithm: Bead sort
PHP Searching and Sorting Algorithm: Exercise-13 with Solution
Write a PHP program to sort a list of elements using Bead sort.
Sample Solution :
PHP Code :
<?php
function columns($my_array) {
if (count($my_array) == 0)
return array();
else if (count($my_array) == 1)
return array_chunk($my_array[0], 1);
array_unshift($my_array, NULL);
// array_map(NULL, $my_array[0], $my_array[1], ...)
$transpose = call_user_func_array('array_map', $my_array);
return array_map('array_filter', $transpose);
}
function bead_sort($my_array) {
foreach ($my_array as $e)
$poles []= array_fill(0, $e, 1);
return array_map('count', columns(columns($poles)));
}
$test_array = array(3, 2, 5, 4, 1, 100);
echo "\nOriginal Array :\n";
echo implode(', ',$test_array );
echo "\nSorted Array :\n";
echo implode(', ',bead_sort($test_array)). PHP_EOL;
?>
Sample Output:
Original Array :3, 2, 5, 4, 1, 100 Sorted Array : 100, 5, 4, 3, 2, 1
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 Radix sort.
Next: Write a PHP program to sort a list of elements using Bogo 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