2002:25

Figurer
Figur 2-1: Femton spelet ..................................................................................................... 3
Figur 2-2: Sorterings exempel - efter Niemann [7]............................................................. 4
Figur 2-3: Sorterings exempel - efter Johansson [8] ........................................................... 4
Figur 2-4: Jämförelse sorterings animeringar ..................................................................... 5
Figur 2-5: Sekvens algoritmer............................................................................................. 6
Figur 2-6: Sekvens algoritmer............................................................................................. 6
Figur 2-7: Träd algoritmer................................................................................................... 6
Figur 2-8: Binärt träd........................................................................................................... 7
Figur 2-9: Graf algoritmer................................................................................................... 7
Figur 2-10: Obalanserat träd................................................................................................ 9
Figur 2-11: Balanserat träd................................................................................................ 10
Figur 2-12: Riktad graf...................................................................................................... 10
Figur 2-13: Oriktad graf.................................................................................................... 11
Figur 2-14: Never Never Land .......................................................................................... 11
Figur 3-1: Meny................................................................................................................. 15
Figur 3-2: BorderLayout ................................................................................................... 16
Figur 3-3: Sorterings design.............................................................................................. 18
Figur 3-4: Hash algoritm design........................................................................................ 19
Figur 3-5: Träd algoritm design ........................................................................................ 20
Figur 4-1: Hashing - Separate Chaining............................................................................ 28
Figur 4-2: Linear Probing.................................................................................................. 29
Figur 5-1: Resultat av bubblesortsortering........................................................................ 31
Figur 5-2: Resultat av implementering av Bubblesort sortering....................................... 32
Figur 5-3: Utförande av quicksort..................................................................................... 33
xi