New answers tagged

0 votes

Can a Code Script be Optimized for Time and Space Complexity Using Logic Gates

Python is an imperative language, meaning any operation can have side effects. This makes such "gate level" thinking tricky. Its written in a way such that there's no issue with a block of ...
Cort Ammon's user avatar
  • 3,286
0 votes

Can a Code Script be Optimized for Time and Space Complexity Using Logic Gates

How much money do you have? There is at the moment no technology that could create configurable hardware that is faster than a general purpose CPU. (Improving configurable hardware would improve the ...
gnasher729's user avatar
  • 29.4k
0 votes

$F(n, L) = 2F(n / 2, L) + nL + n^2 log(n)$ and Master Theorem

You don’t really need the master theorem. If n = 2^k then the result is <= 2 n^2 k + n k L.
gnasher729's user avatar
  • 29.4k
0 votes

Complexity of a naive algorithm for finding the longest Fibonacci substring

Well, if you will use Fibonacci properties with Aho-Corasick automaton, you can easily figure out that the running time is linear.
dod0lp's user avatar
  • 1
0 votes

Tail recursion can't work with dynamic programming programs

I can tell yes... It is not working fine but you can go for some work around that I may not be preferable with. But recently I was working with 0/1 knapsack problem where If I go with the tail ...
Dinesh A's user avatar

Top 50 recent answers are included