TY - JOUR
ID - 31857
TI - Development a Sequential Search Algorithm by using Triple Structure
JO - Engineering and Technology Journal
JA - ETJ
LA - en
SN - 1681-6900
AU - D. Salim, Ragheed
AD -
Y1 - 2011
PY - 2011
VL - 29
IS - 10
SP - 1886
EP - 1892
DO - 10.30684/etj.29.10.2
N2 - 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.
UR - https://etj.uotechnology.edu.iq/article_31857.html
L1 - https://etj.uotechnology.edu.iq/article_31857_f1f9a4d0ceb93e973545216363690460.pdf
ER -