The code below shows an elementary sorting algorithm. void sort( int[] arr ) { for (int...

 

Transcribed Image Text:

The code below shows an elementary sorting algorithm. void sort( int[] arr ) { for (int i = 0; i arr.length-1; i++) { int k = i; for (int j = i + 1; j < arr.length; j++) if (arr [j] arr[k]) k = j; int temp= arr[k]; arr[k] arr[i]; arr[i] temp; } } Suppose you are given the input array: [8,6,5,9,7,1] 1. List the contents of the array after the first iteration of the outer for loop. [ ·[ 2. List the contents of the array after the second iteration of the outer for loop. # # # # # # The code below shows an elementary sorting algorithm. void sort( int[] arr ) { for (int i = 0; i arr.length-1; i++) { int k = i; for (int j = i + 1; j < arr.length; j++) if (arr [j] arr[k]) k = j; int temp= arr[k]; arr[k] arr[i]; arr[i] temp; } } Suppose you are given the input array: [8,6,5,9,7,1] 1. List the contents of the array after the first iteration of the outer for loop. [ ·[ 2. List the contents of the array after the second iteration of the outer for loop. # # # # # #

Answer rating: 100% (QA)

given input array 865971 1 List the contents of the array after ... View the full answer