Algorithms

Spring 2019
course
site

Tue Jan 29

chap 2 - analysis & divide-and-conquer take 1

Discuss the homework due today. My answers are posted.

Finish our discussion of the chapter 2 material, including

Any questions about any of this ?

chap 3 - data structures

Depending on time, we may start the chapter 3 material : data structures.

We want to distinguish between an "abstract data types" (i.e. API) vs its "data structure" implementation (i.e. code to make it happen).

When we're using one for some algorithm or other, we just needs its API and a knowledge of its O() and storage behavior. When we're trying to understand what it is and how it works, then we'll want to look at the implementation.

Chapter 3 gives an overview of the most common data structures, the basic ideas and their advantages and disadvantages, without going into the full implementation details.

The ones we'll discuss

related topics

specialized data structures (which we'll mostly just wave our hands at)


I gave an example of a linked list in python - see the attached code.

https://cs.marlboro.college /cours /spring2019 /algorithms /notes /binsearch
last modified Fri March 29 2024 9:04 am

attachments [paper clip]

  last modified size
TXT node.py Fri Mar 29 2024 09:04 am 484B