Selection Sort — Nitesh Kumar


Introduction It employs a comparison based strategy to sort the elements. It is an in-place sort as it doesn’t require any extra space. This algorithm is called selection sort because it repeatedly selects the next-smallest element and swaps it into place. Suited for small values and for nearly-sorted values. It is more efficient than bubble sort because in […]

via Selection Sort — Nitesh Kumar

Advertisements

Leave a Reply

Please log in using one of these methods to post your comment:

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