# Sort Complexities

• This picture is impressive!

• pretty straight forward. However, I was doubting in first place that e^n is larger which is not the case.

• @naseeb said in Sort Complexities:

pretty straight forward. However, I was doubting in first place that e^n is larger which is not the case.

Situation is not critical if n is relatively small.
So we should think of what happens when n is extremely large.

• It's incredible

• Could anyone tell what is "e"?

• e is an constant

• @Dinmukhamed, e is an exponential term, it holds a certain value, or in a way, it is called a constant.

• i came across this before.......

• Very useful!

• clear and userful.

• very useful article!

• very useful!

• Reviewing these things after one year work. It is interesting!

• HI guys noob here..
I got this question but still wanna learn more about complexities because it confuses me every time. Could anyone please suggest me some book or online course where i can understand easily.
Thanks :)

• @vermazz Crack the Coding Interview. I found a chapter from this book talks about the complexity is really useful. It also gives some exercise questions to help you double check you really understand how to analyze the complexity.

• @shurui Thanks :)

• @vermazz No problem. We are all on the road to success!

• It is so clear and easy to understand. Thanks :]

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.