2. (40 points) Implement the bubble sort algorithm on a array which holds 100 random values...

Transcribed Image Text:

2. (40 points) Implement the bubble sort algorithm on a array which holds 100 random values between -15 and 15. The pseudo-code to implement bubble sort on 10 elements is given below. Display the unsorted array and the sorted array. Algorithm 1 Bubble Sort (10 elements) for i 1 to 9 do for j0 to 8 do if Alj) > Al(+1) then swap(A1(j), A1(+1)) end if end for end for 2. (40 points) Implement the bubble sort algorithm on a array which holds 100 random values between -15 and 15. The pseudo-code to implement bubble sort on 10 elements is given below. Display the unsorted array and the sorted array. Algorithm 1 Bubble Sort (10 elements) for i 1 to 9 do for j0 to 8 do if Alj) > Al(+1) then swap(A1(j), A1(+1)) end if end for end for

Answer rating: 100% (QA)

The bubble sort algorithm is a simple sorting algorithm that repeatedly steps through the list to be sorted compares adjacent elements and swaps them ... View the full answer