Bored? Check out the Recent Activity on Siafoo
Algorithms
##### Keywords
 divide and conquer (2) insertion sort (1) HEP (1) quicksort (1) prng (1) algorithm (1) random (1) sort (1)
 Showing 1 - 6 of 6 Showing 1 - 6 of 6
Insertion Sort is a blissfully simple algorithm that is painfully inefficient for large arrays. It operates in place and with relative efficiency compared to several more complicated (read: better)...
+3
Quicksort is a fast, recursive, divide and conquer algorithm developed by Charles Antony Richard Hoare. It is believed to be the fastest sorting algorithm, in practice [Weiss1999]....
+2
The Wichmann-Hill algorithm is a three seed pseudo-random number generator. The algorithm generates numbers between 0.0 and 1.0 with a cycle of . According to [Bevington] the algorithm is free of...
+1
This sorting algorithm performs multiple passes over a list, comparing consecutive elements. If the two elements are out of order, they are swapped. This continues until a pass shows all elements...
+1
Mergesort is a simple divide and conquer sorting algorithm. It works by recursively splitting an unsorted array into two sub-arrays then merging the sorted results....
Worst sorting algorithm... ever. It repeatedly checks if the array is sorted hoping that cosmic rays will change the numbers enough for them to appear in order....
 Showing 1 - 6 of 6 Showing 1 - 6 of 6