Augmented.js Next Core - Sorting
Sorts an array of objects by property in object (not a deep property)
-
array
array The object array to sort -
key
object The property to sort by -
descending
boolean Reverse the order
Returns array The sorted array
Split the array into halves and merge them recursively
-
array
array The array to sort
Returns array The sorted array
Quick Sort implementation for Arrays -
-
arr
Array Array to Sort
Returns Array Returns a sorted array
Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.
-
array
array The array to sort
Returns array The sorted array
Simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order.
-
array
array The array to sort
Returns array The sorted array