Entry Julstrom:1992:SSW 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{Julstrom:1992:SSW,
  author =       "Bryant A. Julstrom",
  title =        "Slow sorting: a whimsical inquiry",
  journal =      j-SIGCSE,
  volume =       "24",
  number =       "3",
  pages =        "11--13",
  month =        sep,
  year =         "1992",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/142040.142050",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sat Nov 17 18:57:20 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigcse1990.bib",
  abstract =     "Sorting is one of the most common and important
                 computing operations. In analyzing and comparing
                 sorting algorithms, we consider their execution times,
                 as indicated by the number of operations they execute
                 as they sort n elements. The simplest algorithms have
                 times that grow approximately as n$^2$, while more
                 complex algorithms offer times that grow approximately
                 as n log n. This paper pursues a contrary goal: a
                 sorting algorithm whose time grows more quickly than
                 that of the well-known algorithms. The paper exhibits
                 and analyzes such an algorithm.",
  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