ACM Distinguished Dissertation 1985 - Two Issues in Public Key Cryptography
Advanced Calculus (Olmsted)
Advanced Engineering Mathematics - 6th Edtn (Kreyszig)
Advanced Windows - 3rd Edtn
AI...

best case complexity is O(n)

R Sedgewick has some freely available material here : Analysis of Shellsort and ... (http://www.cs.princeton.edu/~rs/shell/)

1) Improving game character AI
2) Parsing sarcasm in natural languages
3) Faking consciousness [think chatbots]
4) Artificial stock market analyst
5) Creating a better Mozart with evolutionary...

Well too bad you seem to have a thing against a Python environment - Py3k is quite handy.
Seems like you'd also be against F# soooooo

1) D [ not C++ / not Java / not C# but ... functionality...

As far as demonstrating big O - you're not going to be able to easily write programs which analyze running time of other programs. The easiest demonstration would be to look at some execution data...