insertsort.cpp

C++&datastructure书籍源码,以前外教提供现在与大家共享

void InsertSort(tvector<string> & a)
// precondition: a contains a.size() elements
// postcondition: elements of a are sorted in non-decreasing order
{
    int k,loc, numElts = a.size();
    
    // invariant: a[0]..a[k-1] sorted 
    for(k=1; k < numElts; k++) 
    {   string hold = a[k];   // insert this element
        loc = k;              // location for insertion
	
        // shift elements to make room for hold/a[k]
        while (0 < loc  && hold < a[loc-1])
        {   a[loc] = a[loc-1];
            loc--;
        }
        a[loc] = hold;
    }
}