Maximum-Speed Search Algorithm

This work introduces a new algorithm for searching in sorted data, since it is the first algorithm that searches within a small specific part of the data differently for each requested input. This comes after analyzing the sorted data itself and calculating its relating key and range values only once. Then, using the key, range and requested number, it defines the considered search data part. While it can use any of the sophisticated search algorithms to implement on small part of the data, it always stays the superior among them. As one of the typical test results shows, the proposed algorithm has about 75% less average-case time complexity and 40% less execution time than those in the traditional Binary Search Algorithm.