How to calculate order (big O) for more complex algorithms (ie quicksort)
- by bangoker
I know there are quite a bunch of questions about big O notation, I have already checked Plain english explanation of Big O , Big O, how do you calculate/approximate it?, and Big O Notation Homework--Code Fragment Algorithm Analysis?, to name a few.
I know by "intuition" how to calculate it for n, n^2, n! and so, however I am completely lost on…