# Array

- array_fusion [edit] v1.1
*Performs a fusion of an array of values specified function. You can use several methods: standard or positive: Executes the sum of the numeric values in an array. negative: As positive but with all the mathematical functions reverse. string: returns the sum of all the positive elements of an array into json format duplicate: returns the sum of all elements of the array multiplied by itself of: returns the sum of all values with odd index and not equal to the number of elements of the same. Media: returns the average of all the elements of meded: returns the average of the average of the sum of all elements of the array selected.* - array_rsearch [edit] v0.1
*Search an array and return position of the last match. If not found, return FALSE.* - binary_search [edit] v0.1
*Search a SORTED array for an item using the binary search method. Check the middle of the array to see if it is the item. If not, search either the lower half or the upper half depending on whether the middle item is greater or lesser than the item. Returns the index of the item, or -1 if item is not found.* - bogosort [edit] v0.1
*An extremely inefficient sorting method. The array is randomly shuffled until it is sorted.* - bubble_sort [edit] v0.2
*Implementation of the "bubble" sorting method. It repeatedly traverses the array to be sorted, swapping adjacent items that are out of order. It stops once the array is traversed with no swaps.* - diceRoll [edit] v0.2
*Rolls a number of dice and returns the results of each roll as well as the total.* - insertion_sort [edit] v0.2
*Implementation of "insertion" sort. Traverses the array once, making sure everything that it has passed is in the right order.* - merge_sort [edit] v0.1
*Sort using the merge method. Each half of the array is sorted recursively, then the two sorted halves are merged.* - quick_sort [edit] v0.1
*Implementation of the "quick sort" method. Selects a pivot and then arranges the array into two smaller arrays: items lesser than pivot and items greater than pivot. The two arrays are then recursively quick sorted.* - random_list [edit] v0.1
*Returns a list containing the values between start and end, but in random order.* - simple_sort [edit] v0.1
*Sort an array and display it.* - sorted [edit] v0.1
*Check if an array is sorted.* - sort_multi_array [edit] v0.1
*Sort a two-dimensional array by one (or more) of the elements in the nested arrays. Accepts a variable number of arguments.* - sum_list [edit] v0.1
*Sum up the numbers in an array.* - word_counts [edit] v0.2
*Return an array recording the number of occurrences of each unique word in the text.*