Merge sort 

Excellent explanation Sir. Thank you very much.

Sir, I think you didn't declare or specify the variables L & R. Please help me & correct me if I'm wrong.

This implementation of merge sort throws an out of bounds exception, because it attempt to access A[i] (in case 1) before checking i==m (in case 2). Here's the fixed version: int Apos = 0, Bpos = 0; for (int i = 0; i < C.size(); i++) { if (Apos == A.size() || ((Bpos < B.size()) && (B[Bpos]

I just hate it when the course about algorithms has algorithms wrong

13:05 The merge function is wrong it should be Merge(L,mid-left,R,right-left+1,B)

the merge algorithm is wrong.