user482594
Reputation
Next privilege 125 Rep.
Vote down
 Jan 23 accepted Solving recurrence relation with unrolling technique Jan 23 comment Solving recurrence relation with unrolling technique I am sorry for not stating complexity analysis. I should have noted that in the question. The answer from @marty_cohen helped me a lot. Jan 23 comment Solving recurrence relation with unrolling technique Thanks a lot! I now understands how it works! Jan 23 revised Solving recurrence relation with unrolling technique edited tags Jan 23 comment Solving recurrence relation with unrolling technique I just want to get a running time complexity (using Big-O notation) of above equation. Jan 23 asked Solving recurrence relation with unrolling technique Dec 5 accepted Question about $\Theta$ notation Dec 5 accepted Question about O notation for recurrence Aug 28 comment Question about $\Theta$ notation @Niel de Beaudrap Thanks! I will study over those topics. In fact, some of my memories are coming back. Aug 28 comment Question about $\Theta$ notation I studied Cal like few years ago such that I do not remember most of the common limit problems.. This is so sad :P Aug 28 asked Question about $\Theta$ notation Aug 27 asked Question about O notation for recurrence Jul 27 comment What would be a failure chance of visiting all nodes in this graph traversal? I understand it now, Thanks!! Jul 27 awarded Supporter Jul 27 awarded Scholar Jul 27 accepted What would be a failure chance of visiting all nodes in this graph traversal? Jul 27 comment What would be a failure chance of visiting all nodes in this graph traversal? Where is 7/8 coming from? Jul 27 revised What would be a failure chance of visiting all nodes in this graph traversal? edited tags Jul 27 awarded Student Jul 27 comment What would be a failure chance of visiting all nodes in this graph traversal? From each node, there are exactly three outgoing edges is the right one..