Joined
Last Seen
-3 Reputation Points
- Strength to Increase Rep
- +0
- Strength to Decrease Rep
- -0
0% Quality Score
- Upvotes Received
- 0
- Posts with Upvotes
- 0
- Upvoting Members
- 0
- Downvotes Received
- 1
- Posts with Downvotes
- 1
- Downvoting Members
- 1
0 Endorsements
Ranked #107.41K
~413 People Reached
Favorite Forums
Computer Science
x
1
|
I'm new to this stuff, so bare with me! I'm trying to determine the time complexity of a recursive algorithm which reverses the branches of a tree. The algorithm in R goes as follows: [CODE]rev <- function (x) { if (is.leaf(x)) return(x) k <- length(x) if (k < 1) stop("dendrogram …
|