1. Bubble Sort (see the algorithm below) 1. (30 points) Construct the decision tree for bubble...

Transcribed Image Text:

1. "Bubble Sort" (see the algorithm below) 1. (30 points) Construct the decision tree for bubble sort (see the pseudo-code below) on three elements (a1, a2, a3). bubbleSort (int arr[])} int n = arr.length; for (int i = 0; i < n-1; i++) for (int j = 0; j < n-i-1; j++) if (arr[j] arr[j+1]) swap arr[j+1] and arr[j] } 1. "Bubble Sort" (see the algorithm below) 1. (30 points) Construct the decision tree for bubble sort (see the pseudo-code below) on three elements (a1, a2, a3). bubbleSort (int arr[])} int n = arr.length; for (int i = 0; i < n-1; i++) for (int j = 0; j < n-i-1; j++) if (arr[j] arr[j+1]) swap arr[j+1] and arr[j] }