Abstrait

HASH BASED SEARCHING ALGORITHM

Jyotirmayee Rautaray, Raghvendra Kumar

Over the years, computer scientist participated research on linear search and Binary Search to find that which one is faster. These are two searching technique the condition of binary search array must be sorted order but in linear search that is not necessary. But in this paper proposed a new searching algorithm which is applicable for both sorted and unsorted array because in this paper we proposed Hash based searching technique for searching elements in the given array.