Register

Made easy workbook

296 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Closure of a set of ...Next → · DCFL or Not
← Previous in category · Binary searchNext in category → · Asymptotic Complexit...
Position:
Show:

Related questions

2 2 votes
1 1 answer
781
781 views
Aman Koli asked Dec 23, 2024
781 views
Made Easy Workbook
int main(){ int c = 0; for(int i = 1; i < n : i++){ for(int j = i + 1; j <= n; j++){ for(int k = 1; k <= j; k++){ c = c + 1; } } } return 0; }What will be the itme comple...
0 0 votes
1 1 answer
789
789 views
KrishnaVardhan asked Oct 6, 2024
789 views
Made easy workbook
Q. 55 Suppose that minimum spanning tree of the following edge weighted graph contains the edges with weights $x, y$ and $z$What is the maximum value of $x+y+z$ ?
0 0 votes
0 0 answers
438
438 views
Huzaifa0111 asked Aug 27, 2023
438 views
Made Easy Workbook
Q. 8 For insertion sort on 3 elements consider the following decision treeEach internal node is labelled by indices of array elements from their original positions. Each ...
2 2 votes
3 3 answers
6.7k
6.7k views
Jyoti Kumari97 asked May 25, 2019
6,695 views
Made easy Workbook 2020
Question:$T(1)=1$$T(n) = 2 T(n - 1) + n$evaluates to?Can anyone solve it by substitution method?Given answer $T(n) = 2^{n+1} - (n+2)$How?