2. 3. 4. a. Write the algorithm for Merge Sort. b. Derive the worst-case tight-bound notation...

 

Transcribed Image Text:

2. 3. 4. a. Write the algorithm for Merge Sort. b. Derive the worst-case tight-bound notation of the algorithm stated in Question 1. a. Derive the upper-bound notation of the function given below using recursion method n 1 c, n> 1 } b. Derive the tight-bound notation of the function given bellow also identify the no T(n)=5n + 2n-10 1. a. Find the Generalized Time Functions of the following code snippet Matrics Multiplication (A, B) { 2. 3. 4. > = { 2T (17) + 5. T(n) 6. 7. 8. + 2cn, // nxm matrix A II mx p matrix B II nxp matrix C || C=AB Let C be a new matrix of the appropriate size For i from 1 to m: For/ from 1 top: Let sum = 0 For k from 1 to m: Return C Set sumsum + Aik Bkj Set Cj- sum b. Write Selection sort algorithm to sort 'n' numbers in descending order. a. Sort the following array using Selection sort 15 3 7 9 5 1 6 b. Derive the worst-case upper-bound asymptotic notation of the Insertion Sort algorithm. 4 2. 3. 4. a. Write the algorithm for Merge Sort. b. Derive the worst-case tight-bound notation of the algorithm stated in Question 1. a. Derive the upper-bound notation of the function given below using recursion method n 1 c, n> 1 } b. Derive the tight-bound notation of the function given bellow also identify the no T(n)=5n + 2n-10 1. a. Find the Generalized Time Functions of the following code snippet Matrics Multiplication (A, B) { 2. 3. 4. > = { 2T (17) + 5. T(n) 6. 7. 8. + 2cn, // nxm matrix A II mx p matrix B II nxp matrix C || C=AB Let C be a new matrix of the appropriate size For i from 1 to m: For/ from 1 top: Let sum = 0 For k from 1 to m: Return C Set sumsum + Aik Bkj Set Cj- sum b. Write Selection sort algorithm to sort 'n' numbers in descending order. a. Sort the following array using Selection sort 15 3 7 9 5 1 6 b. Derive the worst-case upper-bound asymptotic notation of the Insertion Sort algorithm. 4

Answer rating: 100% (QA)

The image contains several questions related to algorithms and notations for time complexity Ill cover each part one by one a The algorithm for Merge ... View the full answer