This is for my computer science class. For my next assignment I've got some questions similar to the following, and I'm having trouble figuring out how I would go about doing them, exactly. Question 1: Algorithm A executes 10n log n operations while Algorithm B executes n 2 operations. Determine the minimum integer value n 0 such that A executes fewer operations than B for n >= n 0. Is there a way to set up equations to compare the two? Or is there something else to it that I'm not seeing? There are no examples similar to this in my book so I'm kind of lost as far as direction.. A point in the right direction is all I'm looking for. Thanks..