Register

solve this question
closed

• closed by
360 views
1 votes
1 votes
closed as a duplicate of: Explain the correctness of the statement
• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
`JEET asked Jan 15, 2019
369 views
How to solve this question
Let A be a finite non-empty set with cardinality n. Let x and y be two of the elements of A. The number of subsets S $\subseteq$ A which include at least one of x or y is
Let A be a finite non-empty set with cardinality n. Let x and y be two of the elements of A. The number of subsets S $\subseteq$ A which include at least one of x or y is...
User Avatar
1 votes
1 votes
1 answer
2
iarnav asked Nov 24, 2018
6,234 views
How to solve this series which is in both AP and GP?
how to solve this series:
how to solve this series:
User Avatar
0 votes
0 votes
1 answer
4
vivek1211 asked Oct 2, 2023
271 views
solve this recurrence relation
T(n) = T(n^1/2) + n doing this in substitution method gives the ans as O(n) but using tree recursion gives the ans as O(nlogn) which of these are correct and which has to be considered for worst case
T(n) = T(n^1/2) + ndoing this in substitution method gives the ans as O(n)but using tree recursion gives the ans as O(nlogn)which of these are correct and which has to be...
User Avatar
Link Copied!