No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
|
How to calculate time complexity of any algorithm or program .... need help on this.. 
|
|
|
Does anyone knows how to solve this? Thanks for suggestions. Find a recurrent relation, its initial conditions and explain how is obtained this relation. A Driver pays in a station of toll using only five cents coins or ten cents coins, throwing one currency a the time. Find the number …
|
|
|
If someone could help me doing a code in VB to do the following: The output should be a list of all posible ways in which (m) different Males and (f) different female could be line up if no two females could be together (one female can not stand after … 
|
|
|
Hello, anyone knows how to solve this. this is what i have to find: find a recurrent relation, its initial conditions and explain as it obtained this relation A carpenter needs to cover n consecutive spaces of 1 foot of a ceiling of two waters with panels of 1 foot … 
|
|
|
Hello, here i need to find the explicit solution for the following recursive expression: (Thanks for any suggestions) A diagonal in a polygon it is a line of a vertex to another vertex that is not adjacent. For example, a triangle does not have diagonals. Find the number of diagonals …
|
|
|
Instructions: Find the Big Oh for the times of excecution of X: = x + 1. You should justify the answer: I : = N WHILE I >= 1 DO BEGIN FOR J : = 1 TO N DO X : = X + 1 I = [I/2] END Thanks … 
|
|
|
I would like to know if anyone could teach me how to solve this type of Mathematical functions: Finding the Big Oh for the following two. Thanks for any suggestions. f(n) = 2 + 4 + 8 + . . . + 2^n f(n) = n!
|