CMPS 2200 Introduction to Algorithms
>
Fall 17
[
Home
|
Policies
|
Slides, pictures
|
Homework
|
Resources
]
Resources
Class schedule
Miscellaneous:
WolframAlpha
Red-Black Tree notes
; overview of insertion and deletion
B-tree notes with more details and variants (also deletion)
16 sort visualized in a color circle
Python visualizer
Gerhard Woeginger's
P vs. NP
page
Demos:
Visualizations of multiple data structures
by David Galles
Red-black trees
Min-heaps
(not max-heaps)
B-trees
; make sure to check "preemtive split/merge" (it uses 2k as the max degree, so it only works for 2k=4 and 2k=6)
Algorithm visualizations on
Visualgo.net
Max-heap demo
(note that the array indices start at 1)
Single source shortest paths demo
Last modified by Carola Wenk, cwenk -at- tulane -dot- edu,