>_<.

크리에이티브 커먼즈 라이선스

이 저작물은 크리에이티브 커먼즈 코리아 저작자표시-비영리-동일조건변경허락 2.0 대한민국 라이선스에 따라 이용하실 수 있습니다.

고쳤다능 ㅠ.ㅠ





소스코드보기










































































#include <iostream>
#include <algorithm>
#include <iterator>
#include <vector>

template <class BidirectionalIterator>
void duplex_selection_sort(BidirectionalIterator first, BidirectionalIterator last);

int main(int argc, char *argv[]) {	
    using namespace std;	
    vector<int> array0, array1, array2;	
    ostream_iterator<int> output(cout, " ");	

    for(int i = 1; i <= 10; i++) {		
        array0.push_back(i);                 		
        array1.push_back(i);		
        array2.insert(array2.begin(), i);	
    }	

    random_shuffle(array0.begin(), array0.end());               	

    cout << "before sort" << endl;	
    copy(array0.begin(), array0.end(), output);	
    cout << endl;	
    copy(array1.begin(), array1.end(), output);	
    cout << endl;	
    copy(array2.begin(), array2.end(), output);	
    cout << endl;	
    
    duplex_selection_sort(array0.begin(), array0.end());	
    duplex_selection_sort(array1.begin(), array1.end());	
    duplex_selection_sort(array2.begin(), array2.end());  	

    cout << "\nafter sort" << endl;	
    copy(array0.begin(), array0.end(), output);	
    cout << endl;	
    copy(array1.begin(), array1.end(), output);	
    cout << endl;	
    copy(array2.begin(), array2.end(), output);	
    cout << endl;	

    return EXIT_SUCCESS;
}

template <class BidirectionalIterator>
void duplex_selection_sort(BidirectionalIterator first, BidirectionalIterator last) {	 	
    BidirectionalIterator min, max;
	
    while(last > first)	{		
        min = max = first;
		
        for(BidirectionalIterator i = first; i != last; i++) {			
            if(*min > *i)				
                min = i;
			
            if(*max < *i)				
                max = i;		
        }
		
        if( (max == first) && (min == last - 1) ) {			
            std::iter_swap(first, last - 1);		
        } 
        else if(max == first) {			
            std::iter_swap(max, last - 1);			
            std::iter_swap(first, min);		
        } 
        else {			
            std::iter_swap(min, first);			
            std::iter_swap(max, last - 1);		
        }		
        first++;		
        last--;	
    }
}



Output: 









before sort
5 4 8 9 1 6 3 2 7 10 
1 2 3 4 5 6 7 8 9 10 
10 9 8 7 6 5 4 3 2 1 

after sort
1 2 3 4 5 6 7 8 9 10 
1 2 3 4 5 6 7 8 9 10 
1 2 3 4 5 6 7 8 9 10