[We hope that you can view the videos! However, if your internet connection is too slow for viewing videos, download the audio file (mp4) and the slides (pdf). Then you can listen to the audio as you go through the slides.]

Practice Prgramming

Live coding demo today! Code with me as I talk you through the algorithms (steps for solving the problem), but it is also ok to watch me complete the code first before you try it yourself. The sorting algorithms we demonstrate today are complex. Don't dwell on the algorithms; instead think about the development of for-loops for lists and also the recursive--divide and conquer--aspect of an algorithm called merge sort.

The recording was much too long! You should feel free to skip the part from 44:00 onwards on developing the code for selection sort and merge sort. You do not need to know the algorithms for sorting--the early part of the recording on practicing with loops and lists is the important part.

• video (sorry about the processing delay!!)
• The audio-only file has been recovered! [Apr 21] Unfortunately there were problems with processing and no audio file is available; we are working with CIT to solve the problem.
• Slides: 19-practice.pdf
• Files:
  • Skeleton file for you to write code to follow along if you wish: lec19_blank.py
  • Or you can follow along with the completed code: lec19_practice.py
  • Given function and other function headers (to save you the typing): lec19_given.py