Emad
  • Member for 10 months
  • Last seen this week
2 answers
4 votes
127 views
Is $\log^{*}(\log(n)) = \Theta (\log(\log^{*}(n)))$?
0 answers
3 votes
58 views
Some guess about concatenation of intersection of languages
1 answers
2 votes
60 views
Best algorithm for solving $A[i] + B[j] = m$
1 answers
2 votes
32 views
Words in computer's memory
1 answers
2 votes
98 views
Some questions about `RANDOM(a, b)`
1 answers
1 votes
30 views
Meaning of source here
1 answers
1 votes
90 views
Input size in graph algorithms
0 answers
1 votes
27 views
Average-case retrieval time
2 answers
1 votes
54 views
Minimal element in logarithmic time
1 answers
1 votes
62 views
Is $n\log_{2}\log_{2}n = O(n\log_{3}\log_{3}n)$?
1 answers
1 votes
79 views
Finding a maximum subarray in worst-case linear time
1 answers
1 votes
118 views
Meaning of this two-variable asymptotic notation
1 answers
1 votes
34 views
Interpreting = in aymptotic notation
1 answers
1 votes
136 views
Difference between function, method, routine, procedure, subprogram, subroutine, block, task
0 answers
1 votes
31 views
Conditions on a and b in Master theorem
1 answers
1 votes
26 views
Solution to a recurrence changing by a constant factor
1 answers
0 votes
82 views
Is top-down dynamic programming always recursive?
0 answers
0 votes
6 views
Are goal-reaching and optimizing the utility function special cases of performance measure?
1 answers
0 votes
36 views
`STACK-FULL` and `QUEUE-FULL` with worst-case $\Theta(1)$
1 answers
0 votes
38 views
Apparently weaker form of big O notation
0 answers
0 votes
52 views
Merging the submatrices' time complexity in matrix multiplication
1 answers
0 votes
62 views
Lower bound on worst-case time complexity of all sorting algorithms neglecting reading input and accessing elements time
2 answers
0 votes
52 views
A so-called random variable not being well-defined
2 answers
0 votes
82 views
Having trouble calculating the asymptotic running time of MAX-HEAPIFY