Shortcut for chapter specific information

Saturday, September 3, 2011

Sorting algorithms from the basic Data Structure course

I spent around 30 minutes to take a look.  It is quite cursory.  Also the goal is to mainly bring up the students on the knowledge of the big O notation.  Of course, you also won't expect there is anything difficult other than just mentioned the basic definition of Oh and Theta.

Bubblesort is using power of 2 which is a bad practice.  Whereas quicksort is not using Sedgewick's implementation.   So one can expect the learning is rather amateurish.

Of course, that is my goal for now. I just hope to finish the class.

No comments:

Post a Comment