Skip List - A Probabilistic Alternative to Balanced Trees
Recommendation |
Not Recommended |
||||
Link |
|||||
Delivery Method |
Java Applet |
||||
License |
Unlicensed Sourcecode |
||||
Language |
English |
||||
Author |
Thomas Wenger |
||||
Institution |
University of Berne, Switzerland |
||||
Project |
|||||
Works |
Yes |
||||
Description |
A simple applet that lets you insert, search, and delete. When you enter a number to insert, it instantly updates the skiplist display to show the new skiplist. There is no ability to watch the algorithm operate. |
||||
Evaluation |
Strengths: Simple interface, nice skiplist layout. Several sites link to this applet. You can quickly generate some different (random) skiplists. Weaknesses: Can't watch the skiplist algorithms operate. You give it a value to insert (or ask it to insert some random values) and you instantly get the resulting skiplist. So not good for student exploration, or understanding how the operations work. |
||||
User Data |
|||||
Lecture Aid |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-06-23 |
||||
Last Visited |
2006-06-23 |
||||
Last Updated |
1997-11-17 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
