Selection Sort Algorithm and its Implementation
3
The basic idea is that in each iteration of this algorithm we pick an element (either largest or smallest, this depends on the sorting scenario) and appends it to the sorted element list, reducing the size of unsorted list by one.
Popular Articles by this blogger
- God Mode in Windows 7 or later - A hidden Windows secret
- Top 5 cool Notepad Tricks – Harmless Virus and Useful things
- Linear Search Algorithm and its Implementation in C and Java
- 7 differences between Serializable and Externalizable interface in Java
- Quick Sort Algorithm –Explanation, Implementation, and Complexity
- Insertion to Linked List – Explanation, Types and Implementation
- Externalizable Interface with inheritance
- How to make your computer welcome you on every reboot