C / C++ / MFC

void SortDrawObjects(CDrawObjList& cList)
{
  for (int i = 0; i < cList.GetCount(); i++) {
    POSITION pos = cList.GetHeadPosition();
    while (pos) {
      POSITION posFirst = pos;
      CDrawObj* pcFirst = cList.GetNext(pos);
      if (pos) {
        POSITION posSecond = pos;
        CDrawObj* pcSecond = cList.GetNext(pos);
        if (pcFirst->m_position.left > pcSecond->m_position.left) {
          cList.SetAt(posFirst, pcSecond);
          cList.SetAt(posSecond, pcFirst);
        }
        pos = posSecond;
      }
    }
  }
}

They sought it with thimbles, they sought it with care;
They pursued it with forks and hope;
They threatened its life with a railway-share;
They charmed it with smiles and soap.

typedef CTypedPtrArray<<CObArray, CDrawObj*>> CDrawObjArray;

CDrawObjArray ObjArray;

const unsigned int nSize = 5;

ObjArray.SetSize(nSize);

for(int i = 0; i < nSize; i++)
{
    CDrawObj* pObj = new CDrawObj(CRect(ptOrigin,sizeRect));
   
    ObjArray[i] = pObj;
}

for(int i = 0; i < nSize; i++)
{
    for(int j = i; j < nSize; j++)
    {
        unsigned int nPrevious = ObjArray[j-1]->m_position.left;
        unsigned int nCurrent = ObjArray[j]->m_position.left;

        if(nPrevious > nCurrent)
        {
            CDrawObj* pObj = ObjArray[j-1];

            ObjArray[j-1] = ObjArray[j];
            ObjArray[j] = pObj ;
        }
    }
}

Michael Waters wrote:

...(using the most inefficient sorting algorithim known to man).

pDC->MoveTo(x,y);

while(oPoint in points collection)
  {
    pDC->LineTo(oPoint.x,oPoint.y);
  }