An Efficient Searching Technique by Colonization of Random Data Set Based On Dynamic Programming
The logarithmic behavior of binary search to find elements requires data set to be arranged in ascending or descending order. This paper introduces the concept of data colonization which means naturally ordered sub-sequences are grouped together to become a data colony so that any type of searching technique could be applied to any ordered sub-sequence independently. Addresses of the colonies i.e. starting and ending of colonies are remembered by using the concept of memorizations from dynamic programming.