HASHSORT - A NOVEL HASHING FUNCTION BASED ON SORTING TECHNIQUE TO RESOLUTE COLLISION

Hash tables are extensively used in data structures to implement tables that associate a set of keys t o a set of values, as they provide O(1), to perform operations such as query, insert and delete operations. However, at moderate collisions are quite frequent which not only increases the access time, but also decrease the performance in the deterministic. Due to this deterministic performance, the hash table degrades. In some systems, it is very difficult to keep the hash operations more deterministic. In rec ent trends, more research papers have been proposed, which employs a new and fast hash functions to implement hash tables and to avoid collisions. In t his paper, we propose a novel hash table implementa tion called Hashsort function, which reduces the Collisi ons occur in the hash table. The basic idea of this paper is to reduce the collisions, such that automatically i t increases the access time. High performance can b e obtained by reducing the collisions in the hash tab le. Hashsort, makes an easy choice for the implementation of hash table in data structure.