Entry Khosraviyani:1990:UBS from sigcse1990.bib

Last update: Wed Sep 26 02:07:32 MDT 2018                Valid HTML 4.0!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Khosraviyani:1990:UBS,
  author =       "Firooz Khosraviyani",
  title =        "Using binary search on a linked list",
  journal =      j-SIGCSE,
  volume =       "22",
  number =       "3",
  pages =        "7--10",
  month =        sep,
  year =         "1990",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/101085.101088",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sat Nov 17 18:57:14 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigcse1990.bib",
  abstract =     "In this article a variation of binary search
                 applicable to a linked list structure is examined.
                 There are no additional data structure properties
                 imposed on the list; that is the list may be singly or
                 multiply linked, but it is not required that the list
                 be represented as a binary tree. The process can be
                 used with improved efficiency in place of linear search
                 on a linked list where introducing additional data
                 structures complexity on the list is not desirable.
                 This procedure seems appropriate for inclusion in data
                 structures courses where searching and sorting are
                 discussed. The texts on data structures cover the
                 binary search on a fixed length sequence, but the
                 general consensus is that there is no advantage in
                 trying to implement the binary search process on linked
                 lists. One possible exception in this regard, where no
                 details are provided, is [2, page 147].",
  acknowledgement = ack-nhfb,
  fjournal =     "SIGCSE Bulletin (ACM Special Interest Group on
                 Computer Science Education)",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J688",
}

Related entries