From: John McCormick <mccormick@cs.uni.edu>
Subject: Re: Ada-based Primer in Big-Oh Notation
Date: Thu, 18 Feb 2010 06:57:40 -0800 (PST)
Date: 2010-02-18T06:57:40-08:00 [thread overview]
Message-ID: <64f3ed1f-f8f7-4327-b751-88484dcce189@e19g2000prn.googlegroups.com> (raw)
In-Reply-To: 47d7b37f-f43f-43b4-a81a-716542a41cf1@l12g2000prg.googlegroups.com
> Can anyone point me to a tutorial at a similar level to Rob's in which
> Ada examples are used?
Hi Rick!
Section 5.4 of my book, Ada Plus Data Structures (Dale and McCormick,
2007), discusses various ways to compare implementations. That
discussion includes an introduction to Big-O and textural descriptions
of the common orders of magnitude. After this introduction, the Big-O
of each algorithm developed in the book is discussed. As the material
is spread out throughout the book, organizing it into a single
tutorial would take some effort.
This is our students' first exposure to Big-O. They see it again in
several other classes. It seems to take several spirals through the
concept adding more details each time for Big-O to sink in.
It would not be difficult to translate Rob's examples into Ada.
John
prev parent reply other threads:[~2010-02-18 14:57 UTC|newest]
Thread overview: 2+ messages / expand[flat|nested] mbox.gz Atom feed top
2010-02-17 23:20 Ada-based Primer in Big-Oh Notation Rick
2010-02-18 14:57 ` John McCormick [this message]
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox