ALGORITMIEK I
ICTVT SE 2.1
Samenvatting
,TABLE OF CONTENTS
1. COMPLEXITEITSANALYSE....................................................................................... 4
ANALYSETYPES ............................................................................................................... 4
VEELVOORKOMENDE MATHEMATISCHE FUNCTIES....................................... 5
DE CONSTANTE FUNCTIE....................................................................................... 5
DE LOGARITMISCHE FUNCTIE .............................................................................. 5
DE LINEARE FUNCTIE ................................................................................................ 5
DE N-LOG-N FUNCTIE ................................................................................................ 5
DE KWADRATISCHE FUNCTIE............................................................................... 6
DE HOGEREMACHTS FUNCTIE.............................................................................. 6
DE EXPONENTIELE FUNCTIE ................................................................................. 6
BIG-OH NOTATIE ............................................................................................................ 7
REKENREGELS v. DOUWES ......................................................................................... 8
2. LOGICA ............................................................................................................................ 9
PROPOSITIELOGICA ...................................................................................................... 9
PREDIKATENLOGICA ..................................................................................................10
3. RECURSIE EN INDUCTIE .........................................................................................12
INDUCTIE .........................................................................................................................12
RECURSIE..........................................................................................................................13
4. ARRAYS EN LINKED LISTS .....................................................................................14
ARRAYS .............................................................................................................................14
LINKED LISTS ..................................................................................................................15
DOUBLY LINKED LISTS...............................................................................................16
CIRCULARLY LINKED LISTS......................................................................................17
5. STACKS, QUEUES EN LIJSTEN ..............................................................................18
STACKS..............................................................................................................................18
QUEUE ...............................................................................................................................19
LIST .....................................................................................................................................19
6. HASH MAPS ..................................................................................................................21
MAP .....................................................................................................................................21
HASH ..................................................................................................................................22
SET.......................................................................................................................................23
7. SORTEREN ....................................................................................................................24
2
, BUBBLE SORT .................................................................................................................24
MERGE SORT ...................................................................................................................25
SORTEREN MET VERGELIJKINGEN.........................................................................26
QUICK SORT....................................................................................................................26
BUCKET SORT ................................................................................................................27
EINDCONCLUSIE SORTEERALGORITMES...........................................................27
3
ICTVT SE 2.1
Samenvatting
,TABLE OF CONTENTS
1. COMPLEXITEITSANALYSE....................................................................................... 4
ANALYSETYPES ............................................................................................................... 4
VEELVOORKOMENDE MATHEMATISCHE FUNCTIES....................................... 5
DE CONSTANTE FUNCTIE....................................................................................... 5
DE LOGARITMISCHE FUNCTIE .............................................................................. 5
DE LINEARE FUNCTIE ................................................................................................ 5
DE N-LOG-N FUNCTIE ................................................................................................ 5
DE KWADRATISCHE FUNCTIE............................................................................... 6
DE HOGEREMACHTS FUNCTIE.............................................................................. 6
DE EXPONENTIELE FUNCTIE ................................................................................. 6
BIG-OH NOTATIE ............................................................................................................ 7
REKENREGELS v. DOUWES ......................................................................................... 8
2. LOGICA ............................................................................................................................ 9
PROPOSITIELOGICA ...................................................................................................... 9
PREDIKATENLOGICA ..................................................................................................10
3. RECURSIE EN INDUCTIE .........................................................................................12
INDUCTIE .........................................................................................................................12
RECURSIE..........................................................................................................................13
4. ARRAYS EN LINKED LISTS .....................................................................................14
ARRAYS .............................................................................................................................14
LINKED LISTS ..................................................................................................................15
DOUBLY LINKED LISTS...............................................................................................16
CIRCULARLY LINKED LISTS......................................................................................17
5. STACKS, QUEUES EN LIJSTEN ..............................................................................18
STACKS..............................................................................................................................18
QUEUE ...............................................................................................................................19
LIST .....................................................................................................................................19
6. HASH MAPS ..................................................................................................................21
MAP .....................................................................................................................................21
HASH ..................................................................................................................................22
SET.......................................................................................................................................23
7. SORTEREN ....................................................................................................................24
2
, BUBBLE SORT .................................................................................................................24
MERGE SORT ...................................................................................................................25
SORTEREN MET VERGELIJKINGEN.........................................................................26
QUICK SORT....................................................................................................................26
BUCKET SORT ................................................................................................................27
EINDCONCLUSIE SORTEERALGORITMES...........................................................27
3
