They’re big on computational complexity in computer science, go figure. An nice way to describe computational complex it with asymptotic notation, basically a rough estimation of how long something takes to run. I was working on my algorithms assignment and came across some asymptotic notations that I hadn’t seen before. To tell you the truth I didn’t even know they were called asymptotic notations; they started us off with big o notation, and then handed us big omega and big theta notation. Now they give me this squirrely w notation (which I discovered is actually called little omega notation) and little o notation, which are very similar to their bigger brothers but different enough to warrant a name change. Anyway, I hadn’t bought the textbook yet but needed to learn what these new notations were but the internet saved me again.