Memory-Sort

Sorts a list of integers or characters utilizing memory to speed up computation time. Time complexity = O(n+m), where n = amount of items in list and m is the difference between the highest and the lowest integers in the list.