Results 1 to 8 of 8
Thread: Programming Fail
-
- Join Date
- 05-13-09
- Location
- Arizona
- Posts
- 6,117
- Post Thanks / Like
- Blog Entries
- 3
04-23-10, 02:51 PM #1Programming Fail
so in my CS122 class, the lass few weeks we've been learning the basics of C++, you know, printing things, taking inputs, file manipulation, for/while loops, data types and operators...the basics. So today my professor busts out sorting algorithms and big O notation... quite a jump don't you think? this class is the first exposure most people have ever had to programming.
-
04-23-10, 03:04 PM #2
Re: Programming Fail
Originally Posted by salty99
Big-O is a hard concept to grasp fully, but I don't think the definition is that hard to understand:
The worst performance an algorithm can do.
But still... I wasn't intro'd to it until my third programming class... but I still knew that the longer a loop ran, the more time it took :P.
Btw, I was intro'd to sorting algorithms in my first class (albeit it was just bubble sort).
And I basically just had a year of algorithms... 1/2 for in-memory, and the other 1/2 for on disk.
-
-
-
-
-
-
04-24-10, 12:18 AM #8
Re: Programming Fail
I hated Big-O notation. I had to teach it to myself (My teacher wasn't a teacher. She was just in the room grading tests and assigning homework without actually going over stuff) and I really struggled. I still don't really understand how to find the Big-O notation of a piece of code.
Sorting algorithms are really, really enjoyable. Especially when you really get into them and figure out how they work and how useful they are. Definitely one of my favorite parts of my Comp Sci AB class last year. That and designing and implementing a large program. That was fun.
Thread Information
Users Browsing this Thread
There are currently 1 users browsing this thread. (0 members and 1 guests)
Bookmarks