Skip to main content
molamola's user avatar
molamola's user avatar
molamola's user avatar
molamola
  • Member for 6 years, 2 months
  • Last seen more than 4 years ago
7 votes
1 answer
21k views

Why time complexity of union-find is $O(lgN)$ with only "Union by Rank"?

5 votes
3 answers
18k views

Difference between dynamic loading and dynamic linking in the OS

4 votes
1 answer
1k views

How do I know the height from recursion tree of $T(n)=4T(n/2+2)+n$?

2 votes
1 answer
5k views

Solving $T(n)=4T(n/4)+\log n$ using master theorem

2 votes
1 answer
144 views

Maximum number of vertices in undirected graph

1 vote
2 answers
644 views

Why the time complexity of Prim's algorithm is not $|V||E|lg|V|$ but $|E|lg|V|$?

1 vote
2 answers
786 views

Time complexity of Rabin-Karp algorithm

0 votes
0 answers
46 views

Understanding the rules of parsing table construction

0 votes
0 answers
164 views

Why Kosaraju's algorithm cannot use original graph by increasing finish time? [duplicate]

0 votes
1 answer
462 views

Can I make last part of counting sort become to be starting from lowest index?

0 votes
1 answer
53 views

Proof of big-o propositions

-1 votes
1 answer
41 views

Little bit confusing to compute time complexity of nested loop [duplicate]