A problem that i cant find solution, someone help me..!
Often is presented the need of search of k keys in a sorted table of n elements. Draw and are analyze three algorithms of mass search, where that is the keys must search with one call of algorithm and no with successive k calls. The three algorithms must support in sequential search, the binary search and search of interjection.
1 Replies - 2344 Views - Last Post: 28 December 2008 - 05:50 AM
#1
three algorithms=sequential search, the binary and interjection..?
Posted 27 December 2008 - 12:50 PM
Replies To: three algorithms=sequential search, the binary and interjection..?
#2
Re: three algorithms=sequential search, the binary and interjection..?
Posted 28 December 2008 - 05:50 AM
Again, I can't really understand your question. Are we talking about any set of numbers or the k largest/smallest numbers?
Page 1 of 1

New Topic/Question
Reply



MultiQuote



|