Computer Science
Profile Activity
Meta user
Network profile
231
reputation
1
9

Ning

Greatest Answer List:

  1. Asymptotic notation(Big-O something):
    1. Sorting functions by asymptotic growth by @Raphael♦
0
answers
11
questions
~3k
people reached
  • Member for 4 years, 2 months
  • 19 profile views
  • Last seen Mar 8 at 9:24

Communities (26)

Top network posts

Top tags (17)

Score 0
Posts 5
Posts % 45
Score 0
Posts 2
Score 0
Posts 1
Score 0
Posts 1
Score 0
Posts 1
Score 0
Posts 1
View all tags →

Top posts (11)

All Questions Answers
Votes Newest
3 Operating System: About user thread and kernel thread? Jul 27 '18
2 Operating System: Busy waiting is not eliminated with semaphore? Jul 28 '18
2 I don't understand the case 4 of red-black tree deletion Feb 6 '19
2 Operating System: Redundancy of implement a monitor using semaphores in my textbook? Jul 28 '18
1 How to analysis the complexity of this LIS program? Mar 6
1 How to prove that the pseudo-code of thresholded-A* algorithm from my teacher's book is correct? Dec 30 '20
1 How to prove that $n^d$ is $O(b^n)$ from $n$ is $O(2^n)$, given that $d>0, b>1$? [duplicate] Mar 12 '18
0 Is this FA really equivalent to the given regular expression? Mar 17 '20
0 Prove that a red-black tree with $n$ internal nodes has height at most $2\lg(n+1)$ Apr 27 '20
0 What is hardware trap? Jul 31 '18
View all questions and answers →

Badges (10)

Gold

—

Silver

1

Rarest

Bronze

9

Rarest

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.