An Implementation of merge sort with out using a recursive function | f**k you, merge sort

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.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s