Changes between Version 12 and Version 13 of FAQ/AlgorithmicComplexity


Ignore:
Timestamp:
Apr 17, 2013, 7:13:37 AM (6 years ago)
Author:
Wendell
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • FAQ/AlgorithmicComplexity

    v12 v13  
    5050and proven to be extremely stable.
    5151It is used even in http://ulan.sourceforge.net/ and SuiTk sources.
    52 GAVL code doesnot need any dynamic memory allocations and it
     52GAVL code does not need any dynamic memory allocations and it
    5353significantly outperforms even heap-tree algorithm with preallocated
    5454array for all elements (Heap tree is suggested solution
     
    102102Even rewrite of the code onto RTEMS primitives from scratch
    103103is possible. Idea is so clean, simple but unique that there
    104 is no problem to reimplement it.
     104is no problem to re-implement it.
    105105= Semaphores with Simple Priority Inheritance =
    106106