Jump to content

Talk:AVL tree/C++: Difference between revisions

no edit summary
(Created page with "The algorithms started out life in Pascal in a book called "Data Structures and Program Design" by Robert L Kruse. These were top/down (i.e. root to leaf) recursive algorithms...")
 
No edit summary
Line 1:
The algorithms started out life in Pascal in a book called "Data Structures and Program Design" by Robert L Kruse. These were top/down (i.e. root to leaf) recursive algorithms without parent pointers. In 2006, the algorithms were made bottom/up (i.e. leaf to root) and the recursion was abolished (using parent pointers). These algorithms may be compared to the red/black set algorithms of STL. [[User:NNcNannara|NNcNannara]] ([[User talk:NNcNannara|talk]]) 12:30, 13 July 2016 (UTC)
 
I tested the elaborate code versus the shorter C++ version (on the main page) with the following results:
 
AVLtree insertions took: 00:00:02.5097816
Set insertions took: 00:00:00.0080027
 
Clearly, AVLtree is more like O(N*N) or worse than O(log N). This is because it descends the tree during rotations (to adjust the balance factor). Set is clearly very fast at O(log N). The test was for 10000 insertions. If 100000 or 1000000 insertions are used Set rips through it but AVLtree stalls the machine.[[User:NNcNannara|NNcNannara]] ([[User talk:NNcNannara|talk]]) 12:45, 15 July 2016 (UTC)
Cookies help us deliver our services. By using our services, you agree to our use of cookies.