Skip to main content
Sayan Bandyapadhyay's user avatar
Sayan Bandyapadhyay's user avatar
Sayan Bandyapadhyay's user avatar
Sayan Bandyapadhyay
  • Member for 10 years, 3 months
  • Last seen more than 3 years ago
5 votes

NP-completeness: Reduce to or reduce from?

4 votes
Accepted

Show that the running time of the build_heap function is $O(n)$

3 votes
Accepted

Cost of partitioning in quicksort

3 votes
Accepted

Shortest path in weighted(positive or negative) undirected graph

3 votes
Accepted

Red black tree partition to $\sqrt{n}$ trees

2 votes

Steiner tree four points example

2 votes

Tree data structure for fast merges

1 vote

What is the maximum achievable throughput in this communication using sliding window protocol?

1 vote

Understanding an algorithm for the gas station problem

1 vote
Accepted

Partition area using test function

1 vote
Accepted

Robot follows a path near an obstacle without colliding

0 votes

What is the difference between expected cost and average cost of an algorithm?

0 votes
Accepted

Find a maximal subgraph on a tree with conditions

-2 votes

Maximum amount of memory that can be allocated to a process