Selection Sort Algorithm(sharpcontents.blogspot.com)
submitted by 
shehmed(65) 3 years, 4 months ago
* Selection sort is a very simple sorting algorithm.
* It starts to find out the smallest element by searching in a linear way and swap it with i place and then find the second smallest by searching from n-i elements and place it at ith place and so on.
* It is improved on the performance of bubble sort.
* Complexity in worst case and average case is О(n²) and the worst case is when it is in sorted order.
* It should not be use when n is large.
|category: C#
|Views: 11
tags:
C# another
Everyones tags:
Your Tags: