Mario Cervera's user avatar
Mario Cervera's user avatar
Mario Cervera's user avatar
Mario Cervera
  • Member for 7 years, 7 months
  • Last seen more than 2 years ago
127 votes
Accepted

Why is it best to use a prime number as a mod in a hashing function?

43 votes

Residual Graph in Maximum Flow

36 votes
Accepted

What is the difference between radix trees and Patricia tries?

31 votes
Accepted

One element that differs in two arrays. How to find it efficiently?

10 votes

O(·) is not a function, so how can a function be equal to it?

8 votes
Accepted

Recurrence relation of the coin change problem

8 votes
Accepted

Big-O complexity of sqrt(n)

7 votes
Accepted

Diameter-constrained Minimum Spanning Tree Problem

7 votes
Accepted

Measuring Complexity of Boolean Satisfiability Problem

6 votes
Accepted

Hash functions and pathological data sets

5 votes

Does the closure of a function include the actual parameter passed to the function?

4 votes
Accepted

Is there a data structure for efficiently searching a string that contains a given substring?

4 votes

Faster algorithm to search in a set of strings

3 votes
Accepted

Understanding the Diameter Constrained MST Problem

3 votes

Hash function to hash 6-digit positive integers

3 votes

Minimum-weight shortest-path tree

3 votes
Accepted

Does an array count as a primitive operation when it is used as an argument in a function call?

2 votes
Accepted

Must a complete subgraph be induced?

2 votes

Extracting the Root of a Leftist Tree

2 votes
Accepted

Does a greedy strategy exist for this instance of the Bin Packing Problem?

2 votes
Accepted

Hash table where items can fall into multiple buckets. What's the name of the data scrtucture?

2 votes
Accepted

Counting the nodes of a unidirectional graph

2 votes
Accepted

Girth of Undirected Graph with Positive Integer Weights

1 vote

Finding the nodes that have degree at least 3 in an undirected graph

1 vote
Accepted

Find pairs of integers (a, b) in an array such that a = b + k in linear time - elements are not unique

1 vote

Time complexity of a greedy approach for Independent Set: the Heaviest-First Algorithm

1 vote
Accepted

How do I find the roots of the disconnected subgraphs of a directed graph?

1 vote

Extract Tree from multi-edge undirected graph

0 votes
Accepted

Solving T(n) = 3T(n/3)+n/2 using master method