lizlongnc · October 9, 2014 04:10
diff --git a/gistfile1.txt b/gistfile1.txt
 Recursion - when a function calls itself.
 Discovered with LISP around 1958.

 A great example of recursion is the quicksort
 algorithm:
  1. use quicksort to divide the array into two groups, low and high
     if alpha, put all items that begin with a-m into 1st group and the remaining in 2nd group
     if numbers, determine the mid-point and put lower nums in 1st group and the remaining in 2nd group unless this type of dividing would          result in one group being much larger than the other, if so, adj mid-point
  2. call quicksort again on each group containing more than one element.
	Recursion - when a function calls itself.
	Discovered with LISP around 1958.

	A great example of recursion is the quicksort
	algorithm:
	1. use quicksort to divide the array into two groups, low and high
	if alpha, put all items that begin with a-m into 1st group and the remaining in 2nd group
	if numbers, determine the mid-point and put lower nums in 1st group and the remaining in 2nd group unless this type of dividing would result in one group being much larger than the other, if so, adj mid-point
	2. call quicksort again on each group containing more than one element.