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