Before you keep reading...
Runestone Academy can only continue if we get support from individuals like you. As a student you are well aware of the high cost of textbooks. Our mission is to provide great books to you for free, but we ask that you consider a $10 donation, more if you can or less if $10 is a burden.
Before you keep reading...
Making great stuff takes time and $$. If you appreciate the book you are reading now and want to keep quality materials free for other students please consider a donation to Runestone Academy. We ask that you consider a $10 donation, but if you can give more thats great, if $10 is too much for your budget we would be happy with whatever you can afford as a show of support.
Summary
Maps (dictionaries) are associative memory organization structures.
Skip lists are linked lists that provide expected
searches.
An octree provides an efficient way to reduce the number of
colors used to represent an image.
Text-based pattern matching is a very common problem in many
application areas.
Simple pattern matching is inefficient.
DFA graphs are easy to use but complex to build.
KMP graphs are easy to use and easy to build.
You have attempted
1 of
1 activities on this page
