Changes between Version 6 and Version 7 of FAQ/AlgorithmicComplexity

Timestamp:

02/03/06 08:02:25 (18 years ago)

Author:

JoelSherrill

Comment:

/* =GAVL */ Formatting

FAQ/AlgorithmicComplexity

@@ -16 +16 @@
 
 When priority ordering of messages is used, the insertion is into a simple list and is O(n) where n is the number of messages pending.
-== GAVL===
+== Pavel Pisa's Sugestion ==
 
-From Pavel Pisa as posted to the RTEMS ML (http://www.rtems.com/ml/rtems-users/2006/february/msg00006.html).
+Posted to the RTEMS ML (http://www.rtems.com/ml/rtems-users/2006/february/msg00006.html).
 
 GAVL can solve this
 
+{{{
 insert    = search O(log(n)),
             max one re-ballance O(1) with max O(log(n)) heights update.
@@ -40 +41 @@
             The +1 one in GAVL is cost  for zero re-balanced
             cut first operation.
+}}}
 
 More about this code is on my page: http://cmp.felk.cvut.cz/~pisa/#ulut
@@ -66 +68 @@
 
 Timers are managed as a delta chain.  Insertion is O(n) where n is the number of timers on the chain (e.g. active).
-
- ==Pavel Pisa's Suggestion====
+== Pavel Pisa's Suggestion ==
 
 http://www.rtems.com/ml/rtems-users/2006/february/msg00006.html