@article {
author = {D. Salim, Ragheed},
title = {Development a Sequential Search Algorithm by using Triple Structure},
journal = {Engineering and Technology Journal},
volume = {29},
number = {10},
pages = {1886-1892},
year = {2011},
publisher = {University of Technology-Iraq},
issn = {1681-6900},
eissn = {2412-0758},
doi = {10.30684/etj.29.10.2},
abstract = {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.},
keywords = {},
url = {https://etj.uotechnology.edu.iq/article_31857.html},
eprint = {https://etj.uotechnology.edu.iq/article_31857_f1f9a4d0ceb93e973545216363690460.pdf}
}