Skip to main content
Share Your Experience: Take the 2024 Developer Survey
Avv's user avatar
Avv's user avatar
Avv's user avatar
Avv
  • Member for 2 years, 9 months
  • Last seen more than a month ago
  • Earth
4 votes
2 answers
4k views

Stability of QuickSort Algorithm

3 votes
3 answers
2k views

Solve $T (n) = T (\frac n2) + n(2 - \cos n)$

2 votes
1 answer
229 views

Why we get at most $N^2$ probe sequences using double hash function

2 votes
0 answers
426 views

Proving that a successful search of hash function is $\Theta(1+\alpha)$

2 votes
1 answer
291 views

Quadratic probing variant scheme

2 votes
1 answer
884 views

Determines the smallest set of unit-length closed intervals that contains all of the given points

2 votes
1 answer
156 views

Visualizing How of KD-tree Data Structure Splits Space

1 vote
1 answer
85 views

Check if Two Arrays Sorted in Decreasing and Increasing Order Satisfy a Condition

1 vote
1 answer
399 views

Find if it's possible to partition a set into 3 disjoint sets each with same sum

1 vote
1 answer
32 views

Replacing the moduleo operation with occasional subtraction and one comparison

1 vote
0 answers
24 views

Prove that any first-order logics with equality and a relation/functional symbol of arity more than 1 is undecidable

1 vote
1 answer
895 views

Lower bound on comparison-based sorting of $k$-sorted arrays

1 vote
0 answers
45 views

Median as pivot selection halves array into one third and two thirds

1 vote
1 answer
56 views

In a sorted subarray $Z_{ij}$ elements $i$ and $j$ get compared when either $i$ or $j$ is pivot

1 vote
1 answer
31 views

For QuickFind, which sub problem we should consider

1 vote
0 answers
294 views

Square of a directed graph $G=\left< V, E\right>$ [closed]

1 vote
0 answers
499 views

Describing the matrix product $BB^T$ of the incidence matrix of a directed graph $G=\left< V,E \right>$

1 vote
1 answer
78 views

Prove that the expected length $E [n_{h(k)}]$ of the list containing key $k $ is at most $1 + \alpha$

1 vote
1 answer
1k views

Number of probes in a unsuccessful search in open address hashing

1 vote
1 answer
493 views

If $(h_2(k),m) = 1$ then $h_1(k)+ih_2(k) \bmod{m}$ is a permutation of $0,\ldots,m-1$

1 vote
2 answers
606 views

Implement a dictionary by using direct addressing on a huge array

1 vote
1 answer
239 views

Detecting odd cycle using mod operator and breadth first search algorithm

1 vote
1 answer
566 views

Why we need topological ordering for finding shortest paths

1 vote
0 answers
22 views

If we have a graph with 2 nodes, the flow added to one edge will be added as extra capacity to be second edge

0 votes
0 answers
60 views

Prove that Horner's method produce only 6 collisions on 50000 English words

0 votes
0 answers
39 views

Randomized Quick Sort Discussion

0 votes
4 answers
645 views

Solving recurrence relation $T(n) = 5T(\frac{n}{3}) + 2n$

0 votes
1 answer
431 views

Array Doubling Size Strategies

0 votes
1 answer
927 views

Solve $T(n) = 3T(\frac n3 + 5) +\frac n2$

0 votes
2 answers
439 views

Complexity of sorting $k$-sorted array using QuickSort and HeapSort