User OmG

46 votes

Accepted

Which Grows Faster: Factorial or Double Exponentiation

answered Nov 25, 2019 at 10:41

15 votes

Time complexity of an algorithm: Is it important to state the base of the logarithm?

answered May 20, 2019 at 18:53

15 votes

Accepted

Why do pushdown automata use a stack?

answered Oct 23, 2018 at 15:57

12 votes

How can I determine if two vertices on a polygon are consecutive?

answered Oct 20, 2019 at 22:20

5 votes

Accepted

Asymptotics of $\frac{1}{\log(\frac{2^n}{2^n-1})}$

answered Nov 17, 2019 at 15:35

5 votes

Accepted

Derive a while loop runs in $\Theta( \sqrt{n} )$

answered Sep 29, 2019 at 17:58

5 votes

Accepted

Why do min/max operations in van Emde Boas trees run in $\mathcal{O}(1)$?

answered Nov 22, 2019 at 18:22

5 votes

Accepted

Does $f(n) \in O(g(n))$ imply $2^{f(n)} \in O(2^{g(n)})$?

answered Mar 15, 2022 at 11:46

5 votes

Data structure for finding max, inserting and deleting in O(1) and O(n) space

answered Oct 1, 2018 at 17:59

5 votes

Strassen algorithm for matrix multiplication complexity analysis

answered Dec 16, 2018 at 17:55

4 votes

Accepted

Let $f(n)=\Omega(n), g(n)=O(n)$ and $h(n)=\theta(n)$ then $f(n).g(n)+h(n)$ is?

answered Dec 10, 2018 at 9:25

4 votes

Accepted

How can we get upper bound in terms of Big Oh notation using Master theorem?

answered Sep 26, 2021 at 21:21

4 votes

Accepted

Prove that there isn't a DFA characterized by (a)+(b) for which |Q| = 3

answered Oct 15, 2019 at 15:33

4 votes

Accepted

Complexity of recursion T(n) = 2T(n-1) + C?

answered May 28, 2020 at 20:02

3 votes

What is the worst-case big-O time complexity for this code?

answered Mar 31, 2020 at 18:27

3 votes

Is this program O(n^2logn) or O(nlog^2(n))?

answered Feb 2, 2020 at 18:08

3 votes

Accepted

Recurrence : $T(n) = 4T(n/2) + Θ(n^2/\log n)$

answered Apr 8, 2020 at 14:20

3 votes

Solving the recurrence relation T(n) = 2T(n/2) + nlog n via summation

answered Sep 30, 2019 at 15:11

3 votes

Accepted

What do these Big-O notations mean in context of comparison

answered Sep 17, 2020 at 12:34

3 votes

Accepted

Understanding access and insertion time of arrays

answered Dec 10, 2018 at 11:31

3 votes

How can two maps be compared?

answered Jun 25, 2018 at 11:06

3 votes

Count numbers less than $K$ in array

answered Dec 23, 2017 at 15:41

3 votes

Accepted

Convex hull of fixed size

answered Feb 8, 2018 at 13:20

2 votes

Accepted

A plane-sweep algorithm for a points in triangles inclusion problem

answered Feb 5, 2018 at 9:21

2 votes

Proving that $xy=yx$ iff $x^2y^2=z^2$

answered Feb 28, 2018 at 23:18

2 votes

Accepted

Time complexity of euler totient function

answered Mar 4, 2018 at 16:47

2 votes

Accepted

Data Structure for State in Automata

answered Jun 5, 2018 at 13:41

2 votes

Algorithm to sort n size input with k distinct elements

answered Dec 22, 2017 at 11:53

2 votes

Turing Machine vs Universal Turing Machine

answered Dec 22, 2017 at 19:27

2 votes

Max() in Domain Relational Calculus

answered Dec 4, 2017 at 16:13

Stack Exchange Network

129 Answers

Which Grows Faster: Factorial or Double Exponentiation

Time complexity of an algorithm: Is it important to state the base of the logarithm?

Why do pushdown automata use a stack?

How can I determine if two vertices on a polygon are consecutive?

Asymptotics of $\frac{1}{\log(\frac{2^n}{2^n-1})}$

Derive a while loop runs in $\Theta( \sqrt{n} )$

Why do min/max operations in van Emde Boas trees run in $\mathcal{O}(1)$?

Does $f(n) \in O(g(n))$ imply $2^{f(n)} \in O(2^{g(n)})$?

Data structure for finding max, inserting and deleting in O(1) and O(n) space

Strassen algorithm for matrix multiplication complexity analysis

Let $f(n)=\Omega(n), g(n)=O(n)$ and $h(n)=\theta(n)$ then $f(n).g(n)+h(n)$ is?

How can we get upper bound in terms of Big Oh notation using Master theorem?

Prove that there isn't a DFA characterized by (a)+(b) for which |Q| = 3

Complexity of recursion T(n) = 2T(n-1) + C?

What is the worst-case big-O time complexity for this code?

Is this program O(n^2logn) or O(nlog^2(n))?

Recurrence : $T(n) = 4T(n/2) + Θ(n^2/\log n)$

Solving the recurrence relation T(n) = 2T(n/2) + nlog n via summation

What do these Big-O notations mean in context of comparison

Understanding access and insertion time of arrays

How can two maps be compared?

Count numbers less than $K$ in array

Convex hull of fixed size

A plane-sweep algorithm for a points in triangles inclusion problem

Proving that $xy=yx$ iff $x^2y^2=z^2$

Time complexity of euler totient function

Data Structure for State in Automata

Algorithm to sort n size input with k distinct elements

Turing Machine vs Universal Turing Machine

Max() in Domain Relational Calculus