131 reputation
5
bio website awoiaf.westeros.org
location France
age 23
visits member for 1 year, 10 months
seen Dec 17 '12 at 1:08

PLEASE DON'T RAPE ME

   \    , __          
    \   \`\\"._     _,
     \  / _  |||;._/ )
      _/@ @  ///  | ( 
     ( (`__,     ,`\| 
      '.\_/ |\_.'     
        `""``

`


Dec
17
accepted Hamiltonian & Eulerian paths, one vertex graph
Dec
12
asked Hamiltonian & Eulerian paths, one vertex graph
Oct
17
accepted Computational complexity proof
Oct
17
accepted Complexity class, logarithms
Oct
17
revised Complexity class, logarithms
added 12 characters in body
Oct
17
asked Complexity class, logarithms
Oct
17
revised Computational complexity proof
added 3 characters in body
Oct
16
comment Computational complexity proof
Ah ok, you advice to try base case with n=4, and to prove by induction.
Oct
16
asked Computational complexity proof
Oct
16
accepted Worst case analysis of a basic algorithm
Oct
16
comment Worst case analysis of a basic algorithm
Thanks guys, I just don't understand how do you find out this result for the second innermost loop ?
Oct
16
comment Worst case analysis of a basic algorithm
No, condition might not be part of the input, it's just to show that there's a test performed I think.
Oct
16
asked Worst case analysis of a basic algorithm
Oct
8
awarded  Scholar
Oct
8
accepted $\log_2$ inequality proof
Oct
8
awarded  Student
Oct
8
awarded  Supporter
Oct
8
comment $\log_2$ inequality proof
Yes, I started with the base case, x=1, but I can't get it for x+1
Oct
8
awarded  Editor
Oct
8
comment $\log_2$ inequality proof
Yes, I mean log base 2 :) I don't really see how to prove that...