Modulo Ten Search- An Alternative to Linear Search

Abstract

Modulo Ten Search is a searching algorithm for finding a particular value in a list by performing modulus Ten of the number . Here the list will be partitioned into ten list based on modulo ten of the number. It searches an item by first taking modulo ten values and finally it undergoes a linear search method. A positional notation is required, but because integers can represent strings of characters (e.g., names or dates) and specially formatted floating point numbers, Modulo Ten Search is not limited to integers