prove this claim, explicitly describe an array A[1 . . . n] for which early-stopping-bubbleSort performs poorly—that is, in Ω(n 2 ) time—on both A and the reverse of A. (programming required)...

prove this claim, explicitly describe an array A[1 . . . n] for which early-stopping-bubbleSort performs poorly—that is, in Ω(n 2 ) time—on both A and the reverse of A.

(programming required) Implement the three versions of Bubble Sort (including the two in Figure 6.23) in a programming language of your choice.

Figure 6.23: Bubble Sort, improved.