CS163: Data structures
Week 11: Sorting & Review
8/2008
CS163 today:
Sorting Algorithms
mergesort
quicksort
As we learn about each sorting algorithm, we will
discuss its efficiency
Review for the FINAL
dbtien Data structures
Mergesort
The mergesort is con
CS163: Data structures
Week 10: Sorting
8/2008
CS163 today:
Sorting Algorithms
selection sort
exchange sort
shell sort
insertion sort
radix sort
As we learn about each sorting algorithm, we will
discuss its efficiency
dbtien Data structures
Sorting in Gen
CS163: Data structures
Week 8: Trees (cont.)
7/2008
CS163: today?
Continue Discussing Trees
Examine more advanced trees
2-3 (evaluate what we learned)
B-Trees
AVL
2-3-4
red-black trees
dbtien Data structures
Discuss 2-3 Trees
A 2-3 tree is always balanced
CS163: Data structures
Week 7: Trees (cont.)
7/2008
What is in CS163 today?
Examine the algorithm to insert
Examine the algorithm to remove
Begin discussing efficiency of tree
Are there any alternatives?
2-3
2-3-4 (next time)
red-black trees (next time)
A
CS163: Data structures
Week 6: Table abstractions (cont.)
6/2008
What will be discussed today?
Table abstractions in terms of new data structures:
Trees
Requires data be organized in a hierarchical fashion
dbtienDatastructures
Tree Introduction
Remembe
CS163: Data structures
Week 4 topic 2:
Table abstract data type
6/2008
What will be discussed?
Work by value rather than position
May be implemented using a variety of
data structures such as
arrays (statically, dynamically allocated)
linear linked lists
CS163: Data structures
Week 4 topic 1:
Other types of linked lists
6/2008
What will be discussed today?
discuss algorithms to manage circular and
doubly linked lists
should we use a dummy head node? What
are the advantages and disadvantages
what about arr
CS163: Data structures
Week 1 topic 2: data abstraction
5/2008
Data Abstraction
Given what we talked about last time, we need to
step through an example of an abstract data type
using
classes,
constructors,
member functions,
data hiding,
distinguishing th