Skip to main content
Emad's user avatar
Emad's user avatar
Emad's user avatar
Emad
  • Member for 3 years, 3 months
  • Last seen more than a week ago
4 votes
2 answers
231 views

Is $\log^{*}(\log(n)) = \Theta (\log(\log^{*}(n)))$?

3 votes
1 answer
3k views

Difference between function, method, routine, procedure, subprogram, subroutine, block, task

3 votes
0 answers
67 views

Some guess about concatenation of intersection of languages

2 votes
1 answer
80 views

Best algorithm for solving $A[i] + B[j] = m$

2 votes
1 answer
346 views

Some questions about `RANDOM(a, b)`

2 votes
1 answer
164 views

Words in computer's memory

1 vote
2 answers
86 views

Minimal element in logarithmic time

1 vote
0 answers
36 views

Average-case retrieval time

1 vote
1 answer
400 views

Input size in graph algorithms

1 vote
1 answer
54 views

Meaning of source here

1 vote
1 answer
72 views

Is $n\log_{2}\log_{2}n = O(n\log_{3}\log_{3}n)$?

1 vote
1 answer
35 views

Solution to a recurrence changing by a constant factor

1 vote
0 answers
40 views

Conditions on a and b in Master theorem

1 vote
1 answer
132 views

Meaning of this two-variable asymptotic notation

1 vote
1 answer
35 views

Interpreting = in aymptotic notation

1 vote
1 answer
439 views

Finding a maximum subarray in worst-case linear time

1 vote
1 answer
244 views

Two statements about optimal binary search trees

0 votes
1 answer
43 views

Confused about the appropriate slot in linear probing

0 votes
0 answers
181 views

Number of subproblems

0 votes
0 answers
88 views

Merging the submatrices' time complexity in matrix multiplication

0 votes
1 answer
38 views

Apparently weaker form of big O notation

0 votes
2 answers
201 views

Having trouble calculating the asymptotic running time of MAX-HEAPIFY

0 votes
1 answer
37 views

`STACK-FULL` and `QUEUE-FULL` with worst-case $\Theta(1)$

0 votes
2 answers
56 views

A so-called random variable not being well-defined

0 votes
1 answer
195 views

Lower bound on worst-case time complexity of all sorting algorithms neglecting reading input and accessing elements time

0 votes
1 answer
380 views

Is top-down dynamic programming always recursive?