Ask your own question, for FREE!
Computer Science 11 Online
OpenStudy (anonymous):

can any 1 explain d complexity theory????????????

OpenStudy (anonymous):

nlog(n) is the fastest. period.

OpenStudy (anonymous):

actually O(1) is the fastest broski

OpenStudy (carlsmith):

apparently not

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!