Question

This BubbleSort algorithm takes as its input the list of "words" w), W2, ...,W.. Step 1: Let j=1. Step 2: If j=n then output the list wi, W2, ...,Wn Step 3: Set k=n-1 Step 4: If wx+1 <wk, then swap the values of wk and wx+1 Step 5: If k>j, then replace k by k-1 and go to step 4. Step 6: Replace j by j +1 Step 7: Go to step 2 Find a function which gives the total number of comparisons and subtractions required if n words are input into this algorithm. The following table should be helpful. 1 1 2 3 3 3 3 2 3 3 3 ... ... ... ... 4 2 3 3 3 n-3 2 3 3 n-1 n-2 2 3 2 n-1 2 2 n ww: wwwnn k= 2 4 3 2 3 3 3 3 2 -

Answer 1

This BubbleSort algorithm takes as its input the list of words w), W2, ...,W.. Step 1: Let j=1. Step 2: If j=n then output

2. This list Bubble sort algorithm takes are it's input the of words" W, W2, ... Who - Anso for the Bubble sort algorithm, given is there are in words as its input . Every bubble sort will go for naa pairs comparisons. for the above of comparisons Subtractions problem, det Count Comp be the count and countsult be the count of Analysis of Algovithm. : Step 1 and Step a will be executed once, where a single comparison is followed , ive. Count comp=1. • step 8 will be executed for once, with no count of compari sons and subtractions • Inner loop will be executed for en times for first iterations, n-1 times for second iteration and so on

so total number of comparisons will be =(n-1)+(n-2)+6–3) +--... +(4)+(3) + (2)+(1) = n(n-1)/2 • Number of So total subtraction for K will be n-7 times. count of number of subtraction will be :-(n-1). Po pseudocode for of comparisons function to find and subtractions the total number is: step :-1; Let J= 1, count comp zo and countsubt=0 Step 2% if Jan, then increment countcomp. and then . aut put the list Wi Wa, ... Wn. Step 3 e set k=n-1 Step 4 & If WK +1 < Wk , then swap the values of Wk and Wkti and increment countcomp Step 5 % If kaj, then increment count sub and replace k by K-1 , Also go to step 4

a Step 6 - Replace j by jt 1 Step 7% Go to step 2 the total number from the This function will then return of comparisons and subtractions given bubble sovit algorithm..