Entry Martin-Sanchez:1995:GIA 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{Martin-Sanchez:1995:GIA,
  author =       "{\'O}scar Mart{\'\i}n-S{\'a}nchez and Crist{\'o}bal
                 Pareja-Flores",
  title =        "A gentle introduction to algorithm complexity for
                 {CS1} with nine variations on a theme by {Fibonacci}",
  journal =      j-SIGCSE,
  volume =       "27",
  number =       "2",
  pages =        "49--56",
  month =        jun,
  year =         "1995",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/201998.202013",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sat Nov 17 18:57:31 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigcse1990.bib",
  abstract =     "In this paper, we propose our ideas about didactic
                 methods and a few examples appropriate to motivate in
                 students the comprehension of the basic principles
                 related to algorithm complexity. Emphasis is put on
                 avoiding formalisms and presenting gradually every new
                 concepts. This paper as well provides for both: an
                 organisation of these ideas and a collection of, we
                 hope, useful examples and experiences that show these
                 concepts in a natural way.",
  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