Computer Science
Meta user
Network profile
235
reputation
1
11

StudentsTea

delete me

2
answers
7
questions
~2k
people reached
  • Member for 5 years
  • 33 profile views
  • Last seen Jan 24 '18 at 15:48

Communities (21)

Top network posts

Top tags (17)

Score 4
Posts 2
Posts % 22
Score 4
Posts 2
Score 1
Posts 2
Score 1
Posts 2
Score 1
Posts 2
Score 1
Posts 2
View all tags →

Top posts (9) All Questions Answers | Votes Newest

7 How is Turing's Solution to the Halting Problem Not Simply “Failure By Design”? Aug 27 '14
4 How is Turing's Solution to the Halting Problem Not Simply “Failure By Design”? Aug 27 '14
2 Is P the set of all algorithms whose run-time is $O\left( n^{ O \left( 1 \right) }\right)$? Apr 19 '17
2 Insertions in Red-Black Trees Mar 28 '17
1 Is this Summary of Asymptotic Analysis Correct? Jan 13 '17
1 Why is it that any graph traversal method can be described as pre-order, in-order, or post-order? What do those terms mean? Feb 10 '17
0 Using Pascal's Triangle to implement queues and stacks using heaps Sep 27 '17
0 The defining property of problems in NP [duplicate] Apr 20 '17
0 Why is it that any graph traversal method can be described as pre-order, in-order, or post-order? What do those terms mean? Feb 10 '17

Badges (12)

Gold

—

Silver

1

Rarest

Bronze

11

Rarest

View all badges →