boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-02-27 17:12:11 +00:00
Code Issues Projects Releases Wiki Activity

fixed typo, missing O(M*N), thanks Karl Fuerlinger!

Browse Source 
[SVN r8384]
This commit is contained in:
Jeremy Siek
2000-12-04 14:54:04 +00:00
parent 4944df198e
commit 6ad9746ec2
1 changed files with 7 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
docs/index.html
View File

@@ -64,13 +64,13 @@ First, each algorithm is written in a data-structure neutral way,
allowing a single template function to operate on many different
classes of containers. The concept of an iterator is the key
ingredient in this decoupling of algorithms and data-structures. The
impact of this technique is a reduction in the STL's code size from to
<i>O(M+N)</i>, where <i>M</i> is the number of algorithms and <i>N</i>
is the number of containers. Considering a situation of 20 algorithms
and 5 data-structures, this would be the difference between writing
100 functions versus only 25! And the differences continues to grow
faster and faster as the number of algorithms and data-structures
increase.
impact of this technique is a reduction in the STL's code size from
<i>O(M*N)</i> to <i>O(M+N)</i>, where <i>M</i> is the number of
algorithms and <i>N</i> is the number of containers. Considering a
situation of 20 algorithms and 5 data-structures, this would be the
difference between writing 100 functions versus only 25! And the
differences continues to grow faster and faster as the number of
algorithms and data-structures increase.
<P>