a) How does the descending order merge sort algorithm work on the following data? y pzxrt...

   

Transcribed Image Text:

a) How does the descending order merge sort algorithm work on the following data? y pzxrt Here, x-last two digits of your student id+1, y=x+3, z=x+y, p=y+z, r=x+2, t-50 b) Discuss the time complexity of the following algorithm. sum=0; for(i=0; i<n; i++){ scanf("%d", &A[i]); j-n-1; while(j>=0){ sum=sum+A[i]+A[j]; [2] [2] a) How does the descending order merge sort algorithm work on the following data? y pzxrt Here, x-last two digits of your student id+1, y=x+3, z=x+y, p=y+z, r=x+2, t-50 b) Discuss the time complexity of the following algorithm. sum=0; for(i=0; i<n; i++){ scanf("%d", &A[i]); j-n-1; while(j>=0){ sum=sum+A[i]+A[j]; [2] [2]

Answer rating: 100% (QA)

Given the structure of your question lets discuss the two parts separately a How does the descending order merge sort algorithm work on the following ... View the full answer