https://wiki.kram.nz/index.php?action=history&feed=atom&title=SE250%3AHTTB%3AWIP%3AHash_Tables%3Ajsmi233-1SE250:HTTB:WIP:Hash Tables:jsmi233-1 - Revision history2026-04-21T15:09:15ZRevision history for this page on the wikiMediaWiki 1.45.3https://wiki.kram.nz/index.php?title=SE250:HTTB:WIP:Hash_Tables:jsmi233-1&diff=2815&oldid=prevMark: 2 revision(s)2008-11-03T05:10:35Z<p>2 revision(s)</p>
<p><b>New page</b></p><div>==Motivation for Hashtables==<br />
<br />
<br />
The big question: WHY!!???!?!?!????!?!?!!?!?!<br />
<br />
Aka: Dude I am sweet with my ArrayList, why do I need a Hashtable??<br />
<br />
Synopsis: Using the example of a natural language processing program (a program that processes a natural language such as english), this screencast tries to explain a situation in which a hashtable is superior to an arraylist.<br />
<br />
<html><br />
<object type="application/x-shockwave-flash" data="http://blip.tv/scripts/flash/showplayer.swf?enablejs=true&feedurl=http%3A%2F%2Fsmth5ter%2Eblip%2Etv%2Frss&file=http%3A%2F%2Fblip%2Etv%2Frss%2Fflash%2F947225%3Freferrer%3Dblip%2Etv%26source%3D1&showplayerpath=http%3A%2F%2Fblip%2Etv%2Fscripts%2Fflash%2Fshowplayer%2Eswf" width="1000" height="700" allowfullscreen="true" id="showplayer"><param name="movie" value="http://blip.tv/scripts/flash/showplayer.swf?enablejs=true&feedurl=http%3A%2F%2Fsmth5ter%2Eblip%2Etv%2Frss&file=http%3A%2F%2Fblip%2Etv%2Frss%2Fflash%2F947225%3Freferrer%3Dblip%2Etv%26source%3D1&showplayerpath=http%3A%2F%2Fblip%2Etv%2Fscripts%2Fflash%2Fshowplayer%2Eswf" /><param name="quality" value="best" /><embed src="http://blip.tv/scripts/flash/showplayer.swf?enablejs=true&feedurl=http%3A%2F%2Fsmth5ter%2Eblip%2Etv%2Frss&file=http%3A%2F%2Fblip%2Etv%2Frss%2Fflash%2F947225%3Freferrer%3Dblip%2Etv%26source%3D1&showplayerpath=http%3A%2F%2Fblip%2Etv%2Fscripts%2Fflash%2Fshowplayer%2Eswf" quality="best" width="1000" height="700" name="showplayer" type="application/x-shockwave-flash"></embed></object><br />
</html></div>Mark