Print ISSN: 1681-6900

Online ISSN: 2412-0758

Author : D. Salim, Ragheed

Development a Sequential Search Algorithm by using Triple Structure

Ragheed D. Salim

Engineering and Technology Journal, 2011, Volume 29, Issue 10, Pages 1886-1892

This paper develops sequential search algorithm by using new structure called Triple structure. In this structure data are represented as triple. It consists of three locations (1-Top, 2- Left, and 3- Right)
Sequential search algorithm is a simplest form. This search is applicable to a table organized either as an array or as a linked list, this process makes the maximum number of comparisons (Average case complexity of Search) is O( n) (pronounce this "big-Oh-n"or "the order of magnitude"), if we search in a list consists of N elements. In this research the number of comparison is reduced to a third by using triple structure, is achieved this process makes the maximum number of comparisons is O(2.5(n/3)) if search in a list consist of N elements.