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. We have run different searching techniques in different colonies on the basis of the size o f the colony and results are satisfactory after comparing with sequential search. As we keep on increasing the size of the colonies by decreasing the colonizational density of data set, the hybrid memorized technique starts sho wing more logarithmic behavior rather linear even the list is not arranged