C / C++ / MFC

/*
 * Compile options needed: /MT
 */ 

#include <afx.h>
#include <iostream.h>
#include <afxcoll.h>

class CSortStringArray : public CStringArray {
public:
   void Sort();
private:
   BOOL CompareAndSwap(int pos);
};
void CSortStringArray::Sort()
{
   BOOL bNotDone = TRUE;

   while (bNotDone)
   {
      bNotDone = FALSE;
      for(int pos = 0;pos < GetUpperBound();pos++)
         bNotDone |= CompareAndSwap(pos);
   }
}
BOOL CSortStringArray::CompareAndSwap(int pos)
{
   CString temp;
   int posFirst = pos;
   int posNext = pos + 1;

   if (GetAt(posFirst).CompareNoCase(GetAt(posNext)) > 0)
   {
      temp = GetAt(posFirst);
      SetAt(posFirst, GetAt(posNext));
      SetAt(posNext, temp);
      return TRUE;

   }
   return FALSE;
}
void main()
{
   CSortStringArray sortArray;

   sortArray.Add(CString("Zebra"));
   sortArray.Add(CString("Bat"));
   sortArray.Add(CString("Apple"));
   sortArray.Add(CString("Mango"));

   for (int i = 0; i <= sortArray.GetUpperBound(); i++)
      cout << sortArray[i] << endl;

   sortArray.Sort();
   cout << endl;

   for (int j = 0; j <= sortArray.GetUpperBound(); j++)
      cout << sortArray[j] << endl;
} 

static int CompareStringsAscending(const void* pElement1, const void* pElement2)
{  
	return ((CString*)pElement1)->Compare(*(CString*)pElement2);
}
 
static int CompareStringsDescending(const void *pElement1, const void* pElement2)
{  
	return -(((CString*)pElement1)->Compare(*(CString*)pElement2));
}
 
static int CompareStringsAscendingNoCase(const void* pElement1, const void* pElement2)
{  
	return ((CString*)pElement1)->CompareNoCase(*(CString*)pElement2);
}
 
static int CompareStringsDescendingNoCase(const void *pElement1, const void* pElement2)
{  
	return -(((CString*)pElement1)->CompareNoCase(*(CString*)pElement2));
}
 
// Sorts the given array of CString objects according to the given set of flags.
void AMS_SortArray(CStringArray* pArray, bool bCaseSensitive = true, bool bAscending = true)
{
	ASSERT(pArray);
 
	int nElements = pArray->GetSize();  
	if (nElements <= 0)     
		return;
	
	int nSize = sizeof(CString*);  
	void* pFirstElement = (void*)&((*pArray)[0]);
	
	if (bCaseSensitive)
	{
		if (bAscending)
			qsort(pFirstElement, nElements, nSize, CompareStringsAscending);
		else
			qsort(pFirstElement, nElements, nSize, CompareStringsDescending);
	}
	else
	{
		if (bAscending)
			qsort(pFirstElement, nElements, nSize, CompareStringsAscendingNoCase);
		else
			qsort(pFirstElement, nElements, nSize, CompareStringsDescendingNoCase);
	}
}

-Matt Newman
-Matt Newman

1. Socket++ is probably the most popular library in this area. Originally written by Gnanasekaran Swaminathan for UNIX environments, it's been later ported to Win32 by Greg Lavender.
   
2. Maciej Sobczak releases an iostream-compatible socket wrapper along with his article on the current (December 2001) C/C++ Users Journal issue, which in addition features other articles about C++ and sockets you might find interesting to look at.
   
3. socketstream library, written by a Korean guy whose name I haven't been able to decipher Haven't tested myself, nor do I have any reference about it.