Entry McCloskey:1995:AAL 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{McCloskey:1995:AAL,
  author =       "Robert McCloskey and John Beidler",
  title =        "An analysis of algorithms laboratory utilizing the
                 maximum segment sum problem",
  journal =      j-SIGCSE,
  volume =       "27",
  number =       "4",
  pages =        "21--26",
  month =        dec,
  year =         "1995",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/216511.216525",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sat Nov 17 18:57:32 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigcse1990.bib",
  abstract =     "This paper describes a laboratory/homework exercise,
                 appropriate for the traditional CS 2 or Data Structures
                 {\&}amp; Algorithms course (CS 7) [1], that gives
                 students practice in analyzing algorithms to determine
                 their asymptotic running times as well as in
                 recognizing the relationship between an algorithm's
                 asymptotic running time and the execution time of a
                 program implementing it. The exercise utilizes the
                 maximum segment sum problem, which, we argue, is a good
                 alternative to sorting, the problem that is probably
                 most often used in exercises of this kind.",
  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