|
|
|
|
|
by amalcon
6047 days ago
|
|
When I was In a numerical approximations course, one other student in the class and I managed to correct the professor about once a week. He wasn't deliberately lying; actually, it was because he had a very poor textbook to work with and was trusting it too much. We were just in the process of doing this again when he demonstrated that you can legitimately say O(n) when you mean O(n^2). Come to find out, he was a math prof, and very much not an algorithms guy. There are two versions of big-oh notation: one for algorithmic complexity, and one for accuracy of approximations. They are exact opposites of each other: higher numbers are "better" for approximation accuracy, at least in the sense they were used in the course. He was unaware of the former, but both of us were unaware of the latter. Not such a great teacher, no. Still, the last mistake was an entirely reasonable one. It's a great example of how even math students need to be on their toes. |
|