It’s been 1 hour. before which I wanted to design an implementation of merge sort with out using a recursive function, as we know the recursive functions are slow due to stack effect. coding phase is ‘ineffable’. After all that, now I got nothing but an under-performing version of merge sort which works only on the input array size of which can be represented in binary notation as 1<<n.
So here’s my under-performing code.