count sort, 300 items with duplicates, 1 frame delay. fisher-yates algorithm for shuffling an algorithm you shouldn't really use. It basically makes a sorted array from a not sorted array in one iteration. it is sometimes used in radix sort. this algorithm is basically: - scan array - ??? - return sorted array without explanation
