Algorithms

Spring 2011
course
navigation

Feb 15

Finish talking about FFT; see the attached python files for DFT and FFT examples, including a real sound file.
(Note that "real" implementations of FFT are typically not recursive; you can do some tricky bit stuff to figure out which term ends up with which factor and is added to what; the "even-odd" recursively ends up being related closely to the binary representation of the index.)
Start discussing data structures, and what they look like in C : struct, typedef, malloc, and more on pointers. See the attached C files.
I've also put an example of a "linked list" in python ... which we'd usually just let python's lists do for us.
http://cs.marlboro.edu/ courses/ spring2011/algorithms/ notes/ Feb_15
last modified Tuesday February 15 2011 12:47 am EST

attachments [paper clip]

     name last modified size
[DOC]FFT.pdf Feb 15 2011 12:26 am 120kB    fourier.py Feb 14 2011 10:35 pm 4.90kB    link_list.py Feb 15 2011 12:47 am 1.30kB [COD]linked_list_example.c Feb 14 2011 10:36 pm 4.24kB    plot_wav.py Feb 14 2011 10:35 pm 1.12kB [COD]struct_malloc_example.c Feb 14 2011 10:36 pm 1.59kB SNDtesting_131072.wav Feb 14 2011 10:35 pm 262kB