Search algorithms are used to extract specific information from large amounts of data. Since the structure and nature of stored data
is completely different, there are different search methods that can be used for different data types and structures. Generally, they are always technical-mathematical search methods that examine the data set for certain characteristics. Simple search methods are based on checking each data word
individually and comparing it with the search characteristic. This sequential search procedure is extremely time consuming and computationally expensive. The time required depends on the position of the searched data word. From a purely statistical point of view, it can be assumed that on average half of the data volume has to be searched. Other search methods try to shorten the search time by using jump and interval methods. In the jump method, individual intervals are first considered and a detail of the searched data word is searched for in these intervals. Only if this occurs in a section of the interval is the interval examined sequentially.