07025

Okay, so my proof:

O(n log n) means the thing complexity will be n log n, right?

This is when it gets crazy:

0.368 * log(0.368) is LESS than 0.

Does this mean that 0.368 seconds for an O(n log n) algorithm is the fastest algorithm ever, or does this mean that the algorithm will actually undo itself if it goes to 0.368 seconds?

EDIT: I shall begin my research in the earnest. This is going to get me a seat at Stanford... At least two theses and a page on every textbook made from here on out.

French Revolutions* :p

by the way: i know it got radical and that, but wouldn't someone see the irony and point it out?

try:
    # ur code (btw jim dont add an except statement)

• Total budget and country of purchase: $500, in the United States.

• Do you prefer a 2 in 1 form factor, good battery life or best specifications for the money? Pick or include any that apply. Good battery life. Might need good specifications for money (RAM, CPU?) because I don't want to suffocate my PC while trying to run stuff. (Chrome isn't a problem, I use Firefox)

Would prefer SSD, but I can't choose with $400 and less. I can't have a laptop with 32Gb or something like that though, as IDEs are so large in file size for some reason. :(

• How important is weight and thinness to you? I prefer light laptops because I'll be traveling with it, and thinness isn't really neces

It hath come out o' constant.