Ternary Search

[justinsbabe5000]

I know how to implement binary search using recursion where you divide the array into 2 parts and recursively search each part for a certain number. Now how do I do this by dividing the array into 3 parts?

For example, if I have an array a[] of some length, and p (0) and q (length of array - 1). What are the lower and upper bounds of each of the three parts?

What would I use as the base case?

[nspils]

Take a look at

http://en.wikipedia.org/wiki/Ternary_search

or

http://forums.sun.com/thread.jspa?threadID=680763