Question

2. Suggest a structured plan (algorithm) for the bubble sort and selection sort, and perform running time analysis for both best and worst case. 3. Consider the age data of 12 children who are supposed to undergo for vaccination in ascending order of their age. Suggest and apply a sorting technique which can efficiently handle this data. Show all the intermediate steps clearly. Child ID 01 02 03 04 05 06 07 08 09 10 11 12 2. Age 1 4 4. Given an array of 14 elements, Show that the worst-case running time of Heap sort on this array is O(nlogn). 4 25 99 8 16 28 13 10 7 17 A= 12 2 18 5. Determine the cyclomatic complexity of the code segment given below, Describe the method for the same. i = 0; n=6; while (i<n-1) do j=i +1; while (j<n) do if A[i]<A[j] then swap(A[i], Ali]): end do; +1; end do;

Answer 1

1. Algorithun ( Bubble bout) for (i=0; i<m-i; i++) ' for (jo; jam-i-i; j++) if (ass [j] > ass & j +1J) 2 temp= a (j]; a [j] = aljti ; xalj +1] = temp; n= size of array Best case - when array is already sested a egi - 1, 2, 3, 4,5 Hence, outer loop will sun only one time and the inmer loop well run in times and then algo will stops Best case time compleinty = 0(m²) hasst case: These neon't be any difference between optimered and nou oblimised versious because worst case will be nehen break stalement get's eneciled and is going to occur when arry is sested in senesse order leg - 5, 4, 3, 2, 1 Complenity = 0(m²) Мемя

election Sort for(i=0; i< N-1; i++) S = i; for ( ja its; j < N; j++) if (A[s]> A ljJ) temp = A[s] A[s] = Ali A [j] = temp دم درا در - kon- ج ام لیا یم Best Case - 0(m²) case horst

o id or 02 03 04 05 06 serting technique - Merge Sort 0901 [215151 90 (216) 3 2312 Cols i 23) 2] Do is 1711214/85 T 12 22 3 4 557 0111.2 223 4555

question 5)

Answer :- Time complexity is Omega(n^2)