Sorting algorithms/Selection sort: Difference between revisions
Content added Content deleted
(→{{header|Common Lisp}}: better example formatting) |
(C++ Selection Sort) |
||
Line 190: | Line 190: | ||
200 |
200 |
||
</pre> |
</pre> |
||
=={{header|C++}}== |
|||
'''Compiler:''' [[g++]] (version 4.3.2 20081105 (Red Hat 4.3.2-7)) |
|||
<lang cpp>#include <algorithm> |
|||
#include <iterator> |
|||
template<typename ForwardIterator> |
|||
void selectionSort(ForwardIterator begin, ForwardIterator end) { |
|||
ForwardIterator i = begin; |
|||
while(i != end) { |
|||
ForwardIterator j = i; |
|||
ForwardIterator min = i; |
|||
while(j != end) { |
|||
if(*j < *min) { |
|||
min = j; |
|||
} |
|||
++j; |
|||
} |
|||
std::iter_swap(i, min); |
|||
++i; |
|||
} |
|||
} |
|||
</lang> |
|||
=={{header|Common Lisp}}== |
=={{header|Common Lisp}}== |