Register

algorithm

• retagged by
1,196 views

1 Answer

1 votes
1 votes
do like that let's for,,,, big O

lets A=O(B) ie. A<=B

a) reflexive:

A<=A ........which is satisfied so reflexive

b) symmetric:

A<=B which is not implied to B<=A .............so not symmetric

c) transitive:

A<=B and B<=C  which is implied A<=C..........so transitive

 do same for omega and theeta notation

omega satisfied reflexive and transitive property

theeta satisfied reflexive, symmetric and transitive property
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
2
usdid asked Apr 16, 2022
281 views
a) what is the iterative equation showing the running time of the algorithm whose pseudocode is given below? b) What is this repeated equation in asymptotic notation using the Master's theorem. c) What is the same repeated equation in asymptotic notation using the recursion tree method.
a) what is the iterative equation showing the running time of the algorithm whose pseudocode is given below? b) What is this repeated equation in asymptotic notation usin...
User Avatar
0 votes
0 votes
1 answer
3
srestha asked Mar 21, 2019
582 views
Allen Career Institute: Algorithm
Which of the following is /are TRUE ? S1 : $n^{a} . n^{b} = 0$((n^{a})^{b})$ for any a, b > 1 S2 : $(n^{a})^{b} = 0$((n^{a})^{b})$ for any a, b > 1 (1) Both S1 and S2 (2) S1 Only (3) S2 Only (4) Neither S1 nor S2
Which of the following is /are TRUE ?S1 : $n^{a} . n^{b} = 0$$((n^{a})^{b})$ for any a, b 1S2 : $(n^{a})^{b} = 0$$((n^{a})^{b})$ for any a, b 1(1) Both S1 and S2(2) S1 ...
User Avatar
0 votes
0 votes
0 answers
4
debanjan sarkar asked Jan 12, 2019
465 views
Algorithm analysis
Find a growth rate that cubes the run time when we double the input size. That is, if T(n) = X, then T(2n) = x^3.
Find a growth rate that cubes the run time when we double the input size. That is, if T(n) = X, then T(2n) = x^3.
User Avatar
Link Copied!