Big-O Exercise (David Budimir) #3

Closed
wants to merge 2 commits into
base: master
from

Conversation

Projects
None yet
2 participants
@dbudimir

dbudimir commented May 13, 2019

No description provided.

}
```

##### Answer: O(N) - Linear complexity

This comment has been minimized.

@Zakk
}
```

##### Answer: O(N^2) - Quadratic complexity.

This comment has been minimized.

@Zakk
}
```

##### Answer: O(N!) - Factorial Complexity

This comment has been minimized.

@Zakk

Zakk May 13, 2019

This one is a bit of a trick! The function is calling itself, which is called recursion and works kind of like a loop

}
```

##### Answer: O(1) - Constant Complexity

This comment has been minimized.

@Zakk
}
```

##### Answer: O(N) - Linear Complexity

This comment has been minimized.

@Zakk
}
```

##### Answer: O(log N) - Logarithmic complexity

This comment has been minimized.

@Zakk

Zakk May 13, 2019

You're very close!

}
```

##### Answer: 0(N) - Linear Complexity

This comment has been minimized.

@Zakk
}
```

##### Answer: O(log N) - Logarithmic complexity

This comment has been minimized.

@Zakk

Zakk May 13, 2019

Very close!

@Zakk

This comment has been minimized.

Zakk commented May 13, 2019

Nice work!

@Zakk Zakk closed this May 13, 2019

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment