3 ms·
Uh it's been ... rather long since my last exposure to formal CS, but did you drop some 'M's?
by unwind 9y ago
Uh it's been ... rather long since my last exposure to formal CS, but did you drop some 'M's?
- Aloraman 9y agoOh crap... yeah. I meant O(N^3) and O(6^M). If both are varied - O(N^M), if both are increasing with same order of magnitude, then complexity can be written as O(N^N) which is O(N! * e^N / sqrt(N))