A sluggish Implementation of Quick Sort

I just came to know about the quick sort. An easy way of implementing the quick sort is by choosing the lowest or highest element or some positioned element which will continue to exist in the recursively decreasing input array up to the penultimate base case. so here’s my lame implementation of Quick Sort.

Advertisements

One thought on “A sluggish Implementation of Quick Sort

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