In bubble sort, the size of the problem is reduced to n-k after k rounds of sweep & swap. For a vector of size n, the optimal time complexity for binary search versions A and B is Θ(1),Θ(log2n). If the distribution of elements in an (ordered) vector satisfies an independent uniform distributi...
