Q&A Discussões

Is O(n*log(n)) complexity better or O(n+klog(n)) complexity better? Can you explain how to determine it?k

big-oh notation time-complexity

0 Voto

7th Sep 2022, 7:58 AM

Ruchika Sehgal

Quente hoje

How can a recursive function works perfectly in a for loop with large numbers while calling it too many times raises an error?

3 Votes

How to allow one instance of exe

1 Votes

Reverse observer pattern : remove dynamic_cast

2 Votes

purchase of a subscription

1 Votes

What has happened?

1 Votes

Theater management help me

2 Votes

seats = 100 (blank) seats > 0: print "sell ticket" (blank) = seats - 1

0 Votes

What should I add/improve ?

1 Votes

Flight tracker coding foundation help me

1 Votes

Should You Specialize or Diversify in Programming?

1 Votes