I'm creating a course in discrete math and python and would be glad to have input and code reviews.
Some of my first programs would be like:
? 1) Given an iterable and a positive integer, return the unique permutations (unique lists) and unique combinations (sets).
? 2) Given a string, return the set of all unique permutations (as strings)
Maybe even showing a few ways to do it in Python and why one way is more efficient and/or pythonic.
I'm looking at these as outlines:
http://www.sm.luth.se/~tomas/MAM200-Python1.pdfhttp://www.math.jmu.edu/~martin/courses/227_fa07/policies.html
A great project is
http://www.sagemath.org/.I might get back into that code (they have a ton of great math built on python) but I kind of want to naively think things through from a basic level so it will make a good course.
Cheers,
Skylar Saveland