1 23 $ 46 5 O A 0 10 1 2 J 8 7 & Are...

 

Transcribed Image Text:

1 23 $ 46 5 O A 0 10 1 2 J 8 7 & Are the following sorting algorithms stable? Give an example to justify your claim if it is not stable (the example needs to have the shortest length). void sorti (int [] a) {sorti (a, a.length-1); } sort1 (int [] a, int end) { void if (end = 0) return; } boolean flag = false; for (int i = 0; i < end; i++) if (a[i] >= a[i+1]) { } flag = true; swap(a, i, i+1); } if (flag) return; sorti (a, end - 1); void sort 2 (int [] a) {sort 2 (a, a. length-1); } void sort2 (int a[], int n) { if (n = 0 && a[i]> last) { a [i+1]= a[i]; i--; } a[i+ 1] = last; 1 23 $ 46 5 O A 0 10 1 2 J 8 7 & Are the following sorting algorithms stable? Give an example to justify your claim if it is not stable (the example needs to have the shortest length). void sorti (int [] a) {sorti (a, a.length-1); } sort1 (int [] a, int end) { void if (end = 0) return; } boolean flag = false; for (int i = 0; i < end; i++) if (a[i] >= a[i+1]) { } flag = true; swap(a, i, i+1); } if (flag) return; sorti (a, end - 1); void sort 2 (int [] a) {sort 2 (a, a. length-1); } void sort2 (int a[], int n) { if (n = 0 && a[i]> last) { a [i+1]= a[i]; i--; } a[i+ 1] = last;