awarded
awarded
awarded
revised
Recurrence T(N)=T(N/LOGN)+1
deleted 3 characters in body; deleted 1 characters in body
Loading…
revised
Recurrence T(N)=T(N/LOGN)+1
added 2 characters in body; added 7 characters in body
Loading…
awarded
revised
Recurrence T(N)=T(N/LOGN)+1
added 4 characters in body; added 47 characters in body; added 21 characters in body
Loading…
revised
Recurrence T(N)=T(N/LOGN)+1
added 6 characters in body
Loading…
revised
Recurrence T(N)=T(N/LOGN)+1
edited body; added 1 characters in body; added 5 characters in body
Loading…
answered
Loading…
comment
Recurrence T(N)=T(N/LOGN)+1
>It will be bounded from below by logn/loglogn Yes,i have got this by replacing LOGN with LOG N_F,where N_F is N which was an argument of the first call. Do you have any ideas for the upper bound?
comment
Recurrence T(N)=T(N/LOGN)+1
This equation (like most questions on math.stackexchange.com,but i didn't find exactly this one) originate from Cormen's book about algorithms. It is not stated clearly anywhere but it can be composed on the base of one of the book's chapters.
comment
Recurrence T(N)=T(N/LOGN)+1
I believe the approximation log(n/logn) is not correct. T(1000 000)= 7,T(1000 000 000 )=9...,it grows much slower. I wonder if there is a method for solving such equations
revised
Recurrence T(N)=T(N/LOGN)+1
added 55 characters in body; added 1 characters in body
Loading…
comment
Recurrence T(N)=T(N/LOGN)+1
Oh sorry,the log is "binary" log with base 2.
Loading…
awarded
revised
Circlular Convolution for two finite sequences of different length.
added 8 characters in body; added 2 characters in body
Loading…
comment
Circlular Convolution for two finite sequences of different length.
I met this on my digital signal processing exam(the question was the length of the output sequence). So,do you know any possible uses of it?
revised
Circlular Convolution for two finite sequences of different length.
added 72 characters in body; added 4 characters in body
Loading…