When I'm talking about algorithm complexity can I afirm that:
The complexity of LOG(N)! is NLOGN?
Ajinkya Kale escreveu:
On 10/22/07, Allysson Costa <[EMAIL PROTECTED]>
wrote:
I have some doubts about summation notation
On 10/22/07, Allysson Costa <[EMAIL PROTECTED]> wrote:
>
>
> I have some doubts about summation notation
>
> 1) Is there a formule like:
>
> SUM (LOG i) i=1 to i=n
>
> is equivalent to
>
> LOG (N)!
>
> This formule is true?
Yes it
Will this work? I tried my solution with some test cases.
# include
void printCombinations( char buffer[], int bI, char string[], int sI, int
length ) ;
int main( void )
{
char str[1024], buf[1024] ;
int i, j, length ;
scanf( "%s", str ) ;
for( length = 0 ; str[length] ; ++leng
I have some doubts about summation notation
1) Is there a formule like:
SUM (LOG i) i=1 to i=n
is equivalent to
LOG (N)!
This formule is true?
=
2) What is relationship
I need experimentally compare RLF and DSATUR graph coloring heuristics
algorithms.
Maybe anyone have some information, or maybe some optimized peas of code ?
:)
Lukas.
--
You can contact me by :
Google Talk: [EMAIL PROTECTED]
Skype: halfas.online.now
IRC: HalFas` (irc2.omnitel.net)
