From: Rick <rickduley@gmail.com>
Subject: Ada-based Primer in Big-Oh Notation
Date: Wed, 17 Feb 2010 15:20:02 -0800 (PST)
Date: 2010-02-17T15:20:02-08:00 [thread overview]
Message-ID: <47d7b37f-f43f-43b4-a81a-716542a41cf1@l12g2000prg.googlegroups.com> (raw)
In preparing a tutorial on binary trees I am looking for an
introductory article on Big-Oh Notation. The NIST article at
http://www.itl.nist.gov/div897/sqg/dads/HTML/bigOnotation.html
is, as expected, excellent - if you are comfortable with mathematics.
The students at whom this tutorial is aimed struggle with mathematics,
and would be much more comfortable with Rob Bell's article at
http://rob-bell.net/2009/06/a-beginners-guide-to-big-o-notation/.
Unfortunately, the examples in Rob's article are not in Ada.
Can anyone point me to a tutorial at a similar level to Rob's in which
Ada examples are used?
Thanks
next reply other threads:[~2010-02-17 23:20 UTC|newest]
Thread overview: 2+ messages / expand[flat|nested] mbox.gz Atom feed top
2010-02-17 23:20 Rick [this message]
2010-02-18 14:57 ` Ada-based Primer in Big-Oh Notation John McCormick
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox