Which of the following is/are true about bubble sort? Its worst case big-O running time is O(n) It performs 2n passes If a pass does not require any comparisons, the input is sorted         I only     II only     III only     I and III     I, II and III

What arrangement of keys is a best case for Bubble Sort, that is, for what input does it do the fewest comparisons? How many comparisons does it do in the best case?

help

The Bubble Sort procedure bubblesort(a1,a2,...,an: real numbers with n>1) for i:=1 to n-1 for j:=1 to n-i   if aj>aj+1 then interchange aj and aj+1 _____________________________________________ Show how this algorithm works on the input sequence 3, 6, 1, 4, 2. What sequence do we have after the first pass (with i=1)? Make sure that you give the current state of the sequence after every pass.