Given two arrays of numbers a₁,......,a_n and b₁,......, b_n where each number is 0 or 1, the fastest algorithm to find the largest span (i, j) such that a_i+a_i+1......a_j = b_i+b_i+1......b_j or report that there is not such span,

Which one of the following in place sorting algorithms needs the minimum number of swaps?

In a binary max heap containing n numbers, the smallest element can be found in time

Which one of the following grammars generates the following language?

$$L = \left( {{a^i}{b^j}|i \ne j} \right)$$