Introduction to Algorithms,implemented in C++

Math

Name	Average	Memory	Comment
fastPower	$O(log(n))$	$O(1)$
hornerRule	$O(n)$	$O(1)$	compute Polynomial by horner Rule
gcd		$O(1)$	compute the greatest common divisor of two integer
primeFactor	$O(n)$	$O(1)$	compute the unique prime factor of integer

Sort

Name	Best	Average	Worest	Memory	InPlace	Stability	Comment
quickSort	$O(nlog(n))$	$O(nlog(n))$	$O(n^2)$	$O(log(n))$	Yes	No	quickSort is usually done in-place with $O(log(n))$ stack space
heapSort	$O(nlog(n))$	$O(nlog(n))$	$O(nlog(n))$	$O(1)$	Yes	No
Utility	X	X	X	X	X	X	some problems soved by sort algorithms

Search

Name	Best	Average	Worest	Memory	InPlace
binarySearch	$Olog(n)$	$Olog(n)$	$Olog(n)$	$O(1)$	Yes