Skip to main content
ryan's user avatar
ryan's user avatar
ryan's user avatar
ryan
  • Member for 7 years, 3 months
  • Last seen more than a month ago
  • Indiana, United States
30 votes
Accepted

Computing exam averages in less than linear time

14 votes

Find largest and second largest elements of the array

9 votes

Solving or approximating recurrence relations for sequences of numbers

9 votes

Solving or approximating recurrence relations for sequences of numbers

9 votes

Where/how did a $\log(n)$ factor disappear from well-known algorithms?

7 votes
Accepted

Building segment tree without adding extra elements to its size

7 votes
Accepted

How to solve recurrence T(n) = 2T(n/2) + n/log(n) using substitution method

6 votes
Accepted

Does KMP Algorithm handle finding multiple matches in overlapping cases?

6 votes

What precisely/concisely is the "head" of a singly linked list? I ask bc of ambiguity online

6 votes

Trie sorting based on word frequency

6 votes

Is there a sorting algorithm of order $n + k \log{k}$?

5 votes

Find the longest possible path in full binary tree

5 votes
Accepted

In Disjoint Sets, why do we make the smaller tree the subtree of the larger one?

5 votes

Find an upper bound for $T(n)=T(\sqrt{n})+10\log\log n$

4 votes
Accepted

Run time of a Simple Recurrence

4 votes

Amortized time of insertion into an Array list

4 votes
Accepted

Check if a binary tree is a perfect tree

4 votes

Reccurence $T(n) = \sqrt{n}T(\sqrt{n})+n$

4 votes
Accepted

What will be the time complexity for the following search algorithm in a graph?

4 votes
Accepted

How to find longest possible identical sequence in Array A and B?

4 votes
Accepted

Run time of recurrence with five uneven calls

4 votes
Accepted

Proving that converting min-heaps to max-heaps requires time Ω(n)

4 votes

Can nested structures be encoded more "readably" with a single delimiter?

4 votes
Accepted

How can I solve $T(n) = 2T(\sqrt{n-1} + 2) + 1$ recurrence using tree method?

4 votes
Accepted

Response time of scheduling a DAG where each vertex is a task

4 votes
Accepted

What does $\tilde{O}_P(N^\alpha)$ mean?

3 votes

Finding all paths from s to t in linear time

3 votes

Why does Min-Max algorithm delays a good move indefinitely?

3 votes
Accepted

What is the big-$O$ notation of a summation of a log?

3 votes
Accepted

Finding the shortest path for synchronized pawns in a maze