C++ Primer 学习中。

。

。

 

简单记录下我的学习过程 (代码为主)

/*****************************************

//

partial_sort(b,se,e)

partial_sort(b,se,e,p)

partial_sort_copy(sb,se,db,de)

partial_sort_copy(sb,se,db,de,p)

*****************************************/

/**----------------------------------------------------------------------------------

STL算法---排序算法

sort()                  make_heap()

stable_sort()           push_heap()

partial_sort()          pop_heap()

partial_sort_copy()     sort_heap()

nth_element()

partition()

stable_partition()

----------------------------------------------------------------------------------**/

/**------http://blog.csdn.net/u010579068------**/#include
     
      #include
      
       #include
       
        #include
        
         #include
         
          #include
          
           #include
           
            using namespace std;/*****************************************//partial_sort(b,se,e)partial_sort(b,se,e,p)partial_sort_copy(sb,se,db,de)partial_sort_copy(sb,se,db,de,p)*****************************************//**----------------------------------------------------------------------------------STL算法---排序算法sort() make_heap()stable_sort() push_heap()partial_sort() pop_heap()partial_sort_copy() sort_heap()nth_element()partition()stable_partition()----------------------------------------------------------------------------------**//*************************************************************************************std::partial_sort 全部排序容器适用 algorithm--------------------------------------------------------------------------------------template 
            
              void partial_sort ( RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last );template 
             
               void partial_sort ( RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp );//eg：*************************************************************************************//*************************************************************************************std::partial_sort_copy 全部排序容器适用 algorithm--------------------------------------------------------------------------------------template 
              
                RandomAccessIterator partial_sort_copy ( InputIterator first,InputIterator last, RandomAccessIterator result_first, RandomAccessIterator result_last );template 
               
                 RandomAccessIterator partial_sort_copy ( InputIterator first,InputIterator last, RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp );//eg：*************************************************************************************/bool myfunction (int i,int j){ return (i
                
                 
                  void Print(T& V){ typename T::iterator iter=V.begin(); while(iter != V.end()) { cout<<*iter++<<" "; } cout<
                  

myvector (myints, myints+9);// vector

::iterator it; // using default comparison (operator <): partial_sort (myvector.begin(), myvector.begin()+5, myvector.end()); cout << "myvector contains:"; Print(myvector); deque

mydeque(myints,myints+9); // using function as comp partial_sort (mydeque.begin(), mydeque.begin()+5, mydeque.end(),myfunction); // print out content: cout << "mydeque contains:"; Print(mydeque);// for (it=myvector.begin(); it!=myvector.end(); ++it)// cout << " " << *it; cout << endl; /**--------------------------------------------------------------------------**/ vector

vec (5); deque

deq (5); // using default comparison (operator <): partial_sort_copy (myints, myints+9, vec.begin(), vec.end()); cout << "myvector contains:"; Print(vec); // using function as comp partial_sort_copy (myints, myints+9, deq.begin(), deq.end(), myfunction); // print out content: cout << "mydeque contains:"; Print(deq);// for (it=myvector.begin(); it!=myvector.end(); ++it)// cout << " " << *it; cout << endl; return 0;}