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.