As promised, I’m sharing my Python code for 3.1 worksheet problems #1, #2 and #3 here. The code in problem 3 wasn’t working properly in class because I had one line tabbed too far in on my loop – beware that nasty whitespace! It works fine now, feel free to sort with it. For a bit of practice, try translating he pseudo code for Algorithm 6 Greedy Change-Making Algorithm from section 3.1 in your text (pg. 199). We can review in class on Tuesday before we move on to section 3.2.
Enjoy your weekend.
Good morning, please be advised that I will need to hold my office hour today at 3-4 pm due to a conflict. Apologies for any inconvenience.
Sample Exam #2 is posted here.
A video of several sorting algorithms at work here.
Watch this amazing video here.
Your second assignment is available here.
As it says in the prompt, this assignment is due by 10 am on 10/11 at our class meeting.
Let me know if you have any questions.
In class on Thursday, 9/27, we discussed the Cantor set, an infinite set. For more information, see here.