1. Evaluation of List Implementations
Lecture 23
Wed, Mar 17, 2004

2. Topics
The Test Program
Evaluation Results

3. Evaluation of List Implementations
The functions of the various List classes were tested by executing each of them 1,000,000 times and computing the average execution time.
Run times are expressed in microseconds.
All functions were applied to a list of 1000 elements.

4. Evaluation of List Implementations
The function GetElement() accessed positions both sequentially and randomly in the list.
The functions Insert() and Delete() accessed elements randomly in the list.

5. The Test Program
TimeTest.cpp

6. Table of Results
Type of List
Get Element
(seq)
(rand)
Insert
Delete
Push
Front
Pop
Back
Array List
0.02
0.30
14.9
15.9
28.7
31.1
0.14
0.23
Circ Array List
0.13
0.38
7.81
7.83
0.21
0.19
0.24
Linked List
8.49
8.81
16.9
19.7
0.68
0.69
32.5
61.1
Linked List w
Tail
8.41
8.82
16.8
19.8
0.71
0.66
35.3
Doubly Linked List
4.51
4.85
8.07
9.13
0.60
0.65
0.67
Circ Linked List
4.53
4.92
8.13
0.64
0.72
0.63