Skip to main content
Computer Science
Olórin's user avatar
Olórin's user avatar
Olórin's user avatar
Olórin
  • Member for 9 years, 11 months
  • Last seen more than 3 years ago
  • Folsom Prison, Folsom, CA, USA
Profile Activity
Stats
859
reputation
83k
reached
1
answer
24
questions
Communities
About

Ash nazg durbatulûk, ash nazg gimbatul, ash nazg thrakatulûk, agh burzum-ishi krimpatul.

Badges
View all badges
2
gold badges
12
silver badges
22
bronze badges
Top tags
View all tags
1
Score
2
Posts
8
Posts %
0
Score
5
Posts
20
Posts %
0
Score
4
Posts
16
Posts %
0
Score
3
Posts
12
Posts %
0
Score
3
Posts
12
Posts %
0
Score
2
Posts
8
Posts %
Top posts
View all questions and answers
question
16
Is there a difference between perfect, full and complete tree?
Oct 28, 2014
question
9
Is the height of the tree the number of edges or number of nodes?
Oct 27, 2014
question
5
Do all greedy algorithm produce just the first solution, no matter how bad it is?
Dec 17, 2014
question
4
What's the big deal with the knapsack problem?
Nov 7, 2014
question
4
When inserting into a binary tree, is there a universal agreed upon place to insert then new node to minimize complexity?
Dec 16, 2014
question
4
Does amortized complexity always equal to worst case complexity divided by n?
Dec 17, 2014
question
4
Greedy proof: Correctness versus optimality
Dec 18, 2014
question
3
Can anyone explain why this is an inadmissible recurrence case that cannot be solved by the master theorem?
Oct 28, 2014
question
3
Can someone provide a trivial example to the "reduction" procedure used to prove hardness? [duplicate]
Dec 15, 2014
question
2
What is the complexity of recurrence $T(n) = T(n-1) + 1/n$ [duplicate]
Dec 17, 2014